PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Mayr, Richard"

Author of the publication

copydeleteadd this publication to your clipboard
Eager Markov Chains.

, , , and . ATVA, volume 4218 of Lecture Notes in Computer Science, page 24-38. Springer, (2006)

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.

Thomas Mayr University of Stuttgart

Richard Völker University of Stuttgart

Univ. -Prof. Dr. Richard Dipper University of Stuttgart

Richard Powers University of Stuttgart

Richard Schömig University of Stuttgart

 

Other publications of authors with the same name

Simulation Preorder over Simple Process Algebras., and . Inf. Comput., 173 (2): 184-198 (2002)Eager Markov Chains., , , and . ATVA, volume 4218 of Lecture Notes in Computer Science, page 24-38. Springer, (2006)Qualitative Analysis of VASS-Induced MDPs., , , , and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 319-334. Springer, (2016)Simulation Preorder on Simple Process Algebras., and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 503-512. Springer, (1999)Undecidable problems in unreliable computations.. Theor. Comput. Sci., 297 (1-3): 337-354 (2003)Automatic Verification of Recursive Procedures with One Integer Parameter., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 198-211. Springer, (2001)Model Checking Lossy Vector Addition Systems., and . STACS, volume 1563 of Lecture Notes in Computer Science, page 323-333. Springer, (1999)Combining Petri Nets and PA-Processes.. TACS, volume 1281 of Lecture Notes in Computer Science, page 547-561. Springer, (1997)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)