On liveness in extended non self-controlling nets

DOI10.1007/3-540-60029-9_32MaRDI QIDQ5096358zbMATH OpenOpenAlexFDO

Authors Kamel Barkaoui, Jean-Michel Couvreur, C. Dutheillet

Publication date 16 August 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60029-9_32

zbMATH Keywords

deadlockslivenesstraps

Mathematics Subject Classification ID

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

Recommendations

• Notes on liveness and boundedness of extended strong asymmetric choice nets. II
• scientific article; zbMATH DE number 3982527
• Liveness for synchronized choice Petri nets
• On liveness and controlled siphons in Petri nets
• A polynomial-time algorithm to decide liveness of bounded free choice nets

Cites work

• A polynomial-time algorithm to decide liveness of bounded free choice nets
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems

Cited in

(11)

• Cycle inclusion property of augmented marked graphs
• A polynomial-time algorithm to decide liveness of bounded free choice nets
• On liveness and boundedness of asymmetric choice nets
• An \(O(|S|\times|T|)\)-algorithm to verify if a net is regular
• Notes on liveness and boundedness of extended strong asymmetric choice nets. II
• Siphons, traps and high-level nets with infinite color domains
• Verification of siphons and traps for algebraic Petri nets
• On the refinement of liveness properties of distributed systems
• New characterization for live and reversible augmented marked graphs
• Macro liveness graph and liveness of -independent unbounded nets
• A note on regular Petri nets

This page was built for publication: On liveness in extended non self-controlling nets

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