Author of the publication

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning.

, and . Petri Nets, volume 6709 of Lecture Notes in Computer Science, page 69-88. Springer, (2011)

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

Visibly Pushdown Transducers with Well-Nested Outputs., and . Int. J. Found. Comput. Sci., 27 (2): 235-258 (2016)Extended Timed Automata and Time Petri Nets., , and . ACSD, page 91-100. IEEE Computer Society, (2006)Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning., and . Petri Nets, volume 6709 of Lecture Notes in Computer Science, page 69-88. Springer, (2011)On Characteristic Formulae for Event-Recording Automata., and . FICS, page 70-78. Institute of Cybernetics, (2009)Robust Analysis of Timed Automata via Channel Machines., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 157-171. Springer, (2008)Trimming Visibly Pushdown Automata., , and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 84-96. Springer, (2013)Playing Stochastically in Weighted Timed Games to Emulate Memory., , and . ICALP, volume 198 of LIPIcs, page 137:1-137:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Robust Class of Languages of 2-Nested Words., , and . MFCS, volume 241 of LIPIcs, page 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Synthesis of Data Word Transducers., , and . CONCUR, volume 140 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quantitative Robustness Analysis of Flat Timed Automata., and . FoSSaCS, volume 6604 of Lecture Notes in Computer Science, page 229-244. Springer, (2011)