On the siphon-based characterization of liveness in sequential resource allocation systems

DOI10.1007/3-540-44919-1_17MaRDI QIDQ3550619zbMATH OpenOpenAlexFDO

Authors Spyros Reveliotis

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

zbMATH Keywords

deadlock resolutionPetri net structural analysissequential resource allocation systemssiphons

Mathematics Subject Classification ID

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

Recommendations

• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems
• Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
• scientific article; zbMATH DE number 2088663
• Resource Allocation Systems: Some Complexity Results on the S4PR Class

Cited in

(10)

• Liveness characterization for GFC systems. II
• Editorial: Deadlock analysis and control in resource allocation systems
• An efficient siphon-based deadlock prevention policy for a class of generalized Petri nets
• An iterative method for synthesizing non-blocking supervisors for a class of generalized Petri nets using mathematical programming
• Liveness-enforcing supervisors synthesis for a class of generalised Petri nets based on two-stage deadlock control and mathematical programming
• Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
• scientific article; zbMATH DE number 1820096 (Why is no real title available?)
• An algorithm to compute the minimal siphons in \(S^4 PR\) nets
• Configuration of liveness-enforcing initial marking with the minimum resources for resource allocation systems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550619)