On liveness and controlled siphons in Petri nets
From MaRDI portal
Publication:4633154
DOI10.1007/3-540-61363-3_4zbMATH Open1418.68131OpenAlexW1546456762MaRDI QIDQ4633154FDOQ4633154
Authors: 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
Recommendations
- scientific article; zbMATH DE number 2088663
- Necessary and sufficient liveness condition of GS3PR Petri nets
- Applications and Theory of Petri Nets 2005
- Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties
- On conditions for the liveness of weakly persistent nets
Cites Work
Cited In (35)
- Liveness and boundedness analysis of Petri net synthesis
- Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs
- Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties
- Applications and Theory of Petri Nets 2005
- Liveness for synchronized choice Petri nets
- Computation of strict minimal siphons in a class of Petri nets based on problem decomposition
- Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software
- A suboptimal deadlock control policy for designing non-blocking supervisors in flexible manufacturing systems
- A survey of siphons in Petri nets
- On conditions for the liveness of weakly persistent nets
- Adaptive supervisory control for a class of Petri nets with bimodal transitions
- New algorithms for deciding the siphon-trap property
- Verification of siphons and traps for algebraic Petri nets
- Finding a witness path for non-liveness in free-choice nets
- Observable liveness of Petri nets
- On Compositionality of Boundedness and Liveness for Nested Petri Nets
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
- Editorial: Deadlock analysis and control in resource allocation systems
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- Improvement on `structure of weakly 2-dependent siphons'
- Methods for the estimation of the size of lookahead tree state-space
- Deadlock and liveness characterization for a class of generalized Petri nets
- Siphons, traps and high-level nets with infinite color domains
- Deadlock detection-oriented unfolding of unbounded Petri nets
- On liveness and boundedness of asymmetric choice 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
- On liveness in extended non self-controlling nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal generating sets for semiflows
- Title not available (Why is that?)
- Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
- 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
This page was built for publication: On liveness and controlled siphons in Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633154)