An algorithm to compute the minimal siphons in S^4 PR nets
From MaRDI portal
Publication:351730
DOI10.1007/S10626-012-0132-4zbMATH Open1267.93107OpenAlexW2044245878MaRDI QIDQ351730FDOQ351730
Authors: E. Cano, Carlos A. Rovetto, J. M. Colom 
Publication date: 9 July 2013
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-012-0132-4
Recommendations
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
- A polynomial algorithm for computing elementary siphons in a class of Petri nets
- An improved algorithm for siphons and minimal siphons in Petri nets based on semi-tensor product of matrices
- An efficient siphon-based deadlock prevention policy for a class of generalized Petri nets
- Resource Allocation Systems: Some Complexity Results on the S4PR Class
Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Title not available (Why is that?)
- The resource allocation problem in flexible manufacturing systems
- Real-time management of resource allocation systems. A discrete event systems approach.
- On the siphon-based characterization of liveness in sequential resource allocation systems
- Fourier's Method of Linear Programming and Its Dual
Cited In (4)
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
- An improved algorithm for siphons and minimal siphons in Petri nets based on semi-tensor product of matrices
- A polynomial algorithm for computing elementary siphons in a class of Petri nets
- An efficient siphon-based deadlock prevention policy for a class of generalized Petri nets
This page was built for publication: An algorithm to compute the minimal siphons in \(S^4 PR\) nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351730)
