On liveness and boundedness of asymmetric choice nets

DOI10.1016/S0304-3975(03)00359-1zbMath1070.68106OpenAlexW1996467290MaRDI QIDQ1884933

Li Jiao, Weiming Lu, To-yat Cheung

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00359-1

zbMATH Keywords

Petri netsAsymmetric choice netsLiveness and boundednessWell-formedness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Checking system boundedness using ordinary differential equations ⋮ Property-preserving subnet reductions for designing manufacturing systems with shared resources

Cites Work

• Structure theory of equal conflict systems
• A method for stepwise refinement and abstraction of Petri nets
• Reduction and synthesis of live and bounded free choice Petri nets
• Reduction and expansion of live and safe marked graphs
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• On liveness and controlled siphons in Petri nets
• Free Choice Petri Nets
• On liveness in Extended Non Self-Controlling Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On liveness and boundedness of asymmetric choice nets