An algorithm to compute the minimal siphons in \(S^4 PR\) nets
From MaRDI portal
Publication:351730
DOI10.1007/s10626-012-0132-4zbMath1267.93107OpenAlexW2044245878MaRDI QIDQ351730
Elia Esther Cano, José-Manuel Colom, Carlos A. Rovetto
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
Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)
Related Items (2)
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
Cites Work
- Unnamed Item
- Real-time management of resource allocation systems. A discrete event systems approach.
- The Resource Allocation Problem in Flexible Manufacturing Systems
- On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems
- Fourier's Method of Linear Programming and Its Dual
This page was built for publication: An algorithm to compute the minimal siphons in \(S^4 PR\) nets
