Author of the publication

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models.

, , and . SPIN, volume 2989 of Lecture Notes in Computer Science, page 216-233. Springer, (2004)

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

Undecidable problems in unreliable computations.. Theor. Comput. Sci., 297 (1-3): 337-354 (2003)Simulation Preorder over Simple Process Algebras., and . Inf. Comput., 173 (2): 184-198 (2002)Advanced Ramsey-Based Büchi Automata Inclusion Testing., , , , , , and . CONCUR, volume 6901 of Lecture Notes in Computer Science, page 187-202. Springer, (2011)Universal Safety for Timed Petri Nets is PSPACE-complete., , , , and . CONCUR, volume 118 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time., and . CONCUR, volume 1664 of Lecture Notes in Computer Science, page 368-382. Springer, (1999)MDPs with energy-parity objectives., , , and . LICS, page 1-12. IEEE Computer Society, (2017)Simulation Problems Over One-Counter Nets., , , and . Logical Methods in Computer Science, (2016)Qualitative Analysis of VASS-Induced MDPs., , , , and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 319-334. Springer, (2016)Eager Markov Chains., , , and . ATVA, volume 4218 of Lecture Notes in Computer Science, page 24-38. Springer, (2006)Simulation Preorder on Simple Process Algebras., and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 503-512. Springer, (1999)