On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems
From MaRDI portal
Publication:3550619
DOI10.1007/3-540-44919-1_17zbMath1274.90138OpenAlexW1479723887MaRDI QIDQ3550619
Publication date: 31 March 2010
Published in: Applications and Theory of Petri Nets 2003 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44919-1_17
Production models (90B30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (7)
An iterative method for synthesizing non-blocking supervisors for a class of generalized Petri nets using mathematical programming ⋮ An algorithm to compute the minimal siphons in \(S^4 PR\) nets ⋮ Liveness-enforcing supervisors synthesis for a class of generalised Petri nets based on two-stage deadlock control and mathematical programming ⋮ Editorial: Deadlock analysis and control in resource allocation systems ⋮ Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming ⋮ An efficient siphon-based deadlock prevention policy for a class of generalized Petri nets ⋮ Deadlock and liveness characterization for a class of generalized Petri nets
This page was built for publication: On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems