PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Jancar, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Bisimilarity of One-Counter Processes Is PSPACE-Complete.

, , and . CONCUR, volume 6269 of Lecture Notes in Computer Science, page 177-191. Springer, (2010)

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.

Dr. rer. nat. Petr Siyushev University of Stuttgart

Dr. rer. pol. Dimitri Petrik University of Stuttgart

Jona Petri University of Stuttgart

Aleko Petrov

Dr. Taras Petrenko University of Stuttgart

 

Other publications of authors with the same name

A note on emptiness for alternating finite automata with a one-letter alphabet., and . Inf. Process. Lett., 104 (5): 164-167 (2007)Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.. Inf. Comput., 206 (11): 1259-1263 (2008)On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs., , and . ACSD, page 47-56. IEEE Computer Society, (2006)Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States., , and . Petri Nets, volume 10877 of Lecture Notes in Computer Science, page 184-203. Springer, (2018)Deciding Bisimulation-Like Equivalences with Finite-State Processes., , and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 200-211. Springer, (1998)A Taxonomy of Forgetting Automata., , and . MFCS, volume 711 of Lecture Notes in Computer Science, page 527-536. Springer, (1993)Restarting Automata., , , and . FCT, volume 965 of Lecture Notes in Computer Science, page 283-292. Springer, (1995)Techniques for Decidability and Undecidability of Bisimilarity., and . CONCUR, volume 1664 of Lecture Notes in Computer Science, page 30-45. Springer, (1999)Bisimilarity of One-Counter Processes Is PSPACE-Complete., , and . CONCUR, volume 6269 of Lecture Notes in Computer Science, page 177-191. Springer, (2010)Monotonic Rewriting Automata with a Restart Operation., , , and . SOFSEM, volume 1338 of Lecture Notes in Computer Science, page 505-512. Springer, (1997)