Avoiding exponential explosion in Petri net models of control flows

DOI10.1007/978-3-031-06653-5_14zbMath1499.68227OpenAlexW4285167247MaRDI QIDQ2165241

Victor Khomenko, A. V. Yakovlev, Maciej Koutny

Publication date: 19 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_14

zbMATH Keywords

Petri netcomplete multipartite graphcontrol flowedge clique coverburst automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Signal Transition Graphs for Asynchronous Data Path Circuits

Cites Work

• Covering graphs by the minimum number of equivalence relations
• On a clique covering problem of Orlin
• Petri net algebra
• Logic Synthesis for Asynchronous Controllers and Interfaces
• The Representation of a Graph by Set Intersections

This page was built for publication: Avoiding exponential explosion in Petri net models of control flows