Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Polyhedron-Hitting Problem., , and . SODA, page 940-956. SIAM, (2015)Revisiting Digitization, Robustness, and Decidability for Timed Automata., and . LICS, page 198-207. IEEE Computer Society, (2003)Complexity of equivalence and learning for multiplicity tree automata., and . J. Mach. Learn. Res., (2015)APEX: An Analyzer for Open Probabilistic Programs., , , , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 693-698. Springer, (2012)Recent Developments in FDR., , , , , , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 699-704. Springer, (2012)Nets with Tokens Which Carry Data., , , , and . ICATPN, volume 4546 of Lecture Notes in Computer Science, page 301-320. Springer, (2007)An Accessible Approach to Behavioural Pseudometrics., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1018-1030. Springer, (2005)On the decidability of reachability in linear time-invariant systems., , , , and . HSCC, page 77-86. ACM, (2019)Complexity of Equivalence and Learning for Multiplicity Tree Automata., and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 414-425. Springer, (2014)Probabilistic Automata of Bounded Ambiguity., , and . CONCUR, volume 85 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)