Author of the publication

On Functions Weakly Computable by Petri Nets and Vector Addition Systems.

, and . RP, volume 8762 of Lecture Notes in Computer Science, page 190-202. Springer, (2014)

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

On the index of Simon's congruence for piecewise testability., and . CoRR, (2013)Verifying Performance Equivalence for Timed Basic Parallel Processes., , and . FoSSaCS, volume 1784 of Lecture Notes in Computer Science, page 35-47. Springer, (2000)Model Checking Timed Automata with One or Two Clocks., , and . CONCUR, volume 3170 of Lecture Notes in Computer Science, page 387-401. Springer, (2004)Fundamental Structures in Well-Structured Infinite Transition Systems., and . LATIN, volume 1380 of Lecture Notes in Computer Science, page 102-118. Springer, (1998)Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets.. MFCS, volume 6281 of Lecture Notes in Computer Science, page 616-628. Springer, (2010)The Height of Piecewise-Testable Languages with Applications in Logical Complexity., and . CSL, volume 62 of LIPIcs, page 37:1-37:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the piecewise complexity of words and periodic words., , , and . CoRR, (2023)\tau-Bisimulations and Full Abstraction for Refinement of Actions., and . Inf. Process. Lett., 40 (4): 219-222 (1991)Towards the automatic verification of PLC programs written in Instruction List., , , , and . SMC, page 2449-2454. IEEE, (2000)On the State Complexity of Closures and Interiors of Regular Languages with Subwords., and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 234-245. Springer, (2014)