( en | de | ru )

 

Disambiguation of "Jancar, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Petri Nets and Regular Processes.

, , and . J. Comput. Syst. Sci., 59 (3): 476-503 (1999)

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.

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Petr Bohata

 

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)Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States., , and . Fundam. Informaticae, 169 (1-2): 123-150 (2019)Structural Liveness of Immediate Observation Petri Nets., and . Fundam. Informaticae, 188 (3): 179-215 (2022)Structural Liveness of Immediate Observation Petri Nets., and . CoRR, (2021)Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.. Inf. Comput., 206 (11): 1259-1263 (2008)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)A Taxonomy of Forgetting Automata., , and . MFCS, volume 711 of Lecture Notes in Computer Science, page 527-536. Springer, (1993)An Approach to Verification of MPI Applications Defined in a High-Level Model., , , and . ACSD, page 55-64. IEEE Computer Society, (2016)On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs., , and . ACSD, page 47-56. IEEE Computer Society, (2006)Techniques for Decidability and Undecidability of Bisimilarity., and . CONCUR, volume 1664 of Lecture Notes in Computer Science, page 30-45. Springer, (1999)