Author of the publication

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems.

, , and . ATAED@Petri Nets/ACSD, volume 2371 of CEUR Workshop Proceedings, page 6-22. CEUR-WS.org, (2019)

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

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm., and . ICTAC, volume 12545 of Lecture Notes in Computer Science, page 143-160. Springer, (2020)Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems., , and . ATAED@Petri Nets/ACSD, volume 2371 of CEUR Workshop Proceedings, page 6-22. CEUR-WS.org, (2019)A New Property of Choice-Free Petri Net Systems., , and . Petri Nets, volume 12152 of Lecture Notes in Computer Science, page 89-108. Springer, (2020)Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures., , and . CS&P, volume 1492 of CEUR Workshop Proceedings, page 222-233. CEUR-WS.org, (2015)Generating All Minimal Petri Net Unsolvable Binary Words., , , and . Stringology, page 33-46. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach., , and . Trans. Petri Nets Other Model. Concurr., (2019)Reversing Transitions in Bounded Petri Nets., , , , and . CS&P, volume 1698 of CEUR Workshop Proceedings, page 74-85. CEUR-WS.org, (2016)Generating all minimal petri net unsolvable binary words., , , and . Discret. Appl. Math., (2020)Reachability Graphs of Two-Transition Petri Nets., and . ATAED@Petri Nets/ACSD, volume 1847 of CEUR Workshop Proceedings, page 39-54. CEUR-WS.org, (2017)Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond., , and . Trans. Petri Nets Other Model. Concurr., (2021)