On liveness and controlled siphons in Petri nets

DOI10.1007/3-540-61363-3_4zbMath1418.68131OpenAlexW1546456762MaRDI QIDQ4633154

Kamel Barkaoui, Jean-François Pradat-Peyre

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_4

zbMATH Keywords

rank theoreminput placeinitial markingminimal siphonvaluation versus

Mathematics Subject Classification ID

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

Related Items (16)

On liveness and boundedness of asymmetric choice nets ⋮ Methods for the estimation of the size of lookahead tree state-space ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Adaptive supervisory control for a class of Petri nets with bimodal transitions ⋮ Deadlock detection-oriented unfolding of unbounded Petri nets ⋮ Robustness of deadlock control for a class of Petri nets with unreliable resources ⋮ Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems ⋮ Editorial: Deadlock analysis and control in resource allocation systems ⋮ A survey of siphons in Petri nets ⋮ Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs ⋮ A suboptimal deadlock control policy for designing non-blocking supervisors in flexible manufacturing systems ⋮ Petri net representation and reachability analysis of 0--1 integer linear programming problems ⋮ Computation of strict minimal siphons in a class of Petri nets based on problem decomposition ⋮ An efficient siphon-based deadlock prevention policy for a class of generalized Petri nets ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable ⋮ Deadlock and liveness characterization for a class of generalized Petri nets

Cites Work

• A polynomial-time algorithm to decide liveness of bounded free choice nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On liveness and controlled siphons in Petri nets