Reduction and expansion of live and safe marked graphs
From MaRDI portal
Publication:3856666
DOI10.1109/TCS.1980.1084711zbMath0422.94068MaRDI QIDQ3856666
No author found.
Publication date: 1980
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
analysis of marked graphscircuit reductions and expansionsequivalence classes of live and safe markings
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15)
Related Items
On liveness and boundedness of asymmetric choice nets, Stubborn versus structural reductions for Petri nets, Structure and behavior preservation by Petri-net-based refinements in system design, A method for stepwise refinement and abstraction of Petri nets
