On liveness in Extended Non Self-Controlling Nets

DOI10.1007/3-540-60029-9_32zbMath1496.68213OpenAlexW1866370004MaRDI QIDQ5096358

Kamel Barkaoui, Jean-Michel Couvreur, Claude 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

livenessdeadlockstraps

Mathematics Subject Classification ID

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

Related Items (4)

On liveness and boundedness of asymmetric choice nets ⋮ New characterization for live and reversible augmented marked graphs ⋮ A note on regular Petri nets ⋮ Cycle inclusion property of augmented marked graphs

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

This page was built for publication: On liveness in Extended Non Self-Controlling Nets