Synthesis of a Class of Deadlock-Free Petri Nets

DOI10.1145/828.322441zbMath0629.68066OpenAlexW2018205453MaRDI QIDQ3766868

Sukumar Ghosh, Ajoy K. Datta

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/828.322441

zbMATH Keywords

livenessPetri netsdeadlockregular netsnet labeling

Mathematics Subject Classification ID

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

Related Items (3)

A new methodology for analyzing distributed systems modeled by petri nets ⋮ High-level Petri-net model for a resource-sharing problem ⋮ Behavior relativity of Petri nets.

This page was built for publication: Synthesis of a Class of Deadlock-Free Petri Nets