Synthesis of a Class of Deadlock-Free Petri Nets

DOI10.1145/828.322441MaRDI QIDQ3766868zbMATH OpenOpenAlexFDO

Authors Ajoy K. Datta, Sukumar Ghosh

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

deadlocklivenessnet labelingPetri netsregular nets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4014040
• Petri Net Synthesis for Restricted Classes of Nets
• scientific article; zbMATH DE number 4033101
• A Class of Well Structured Petri Nets for Flexible Manufacturing Systems
• Liveness and boundedness analysis of Petri net synthesis

Cited in

(10)

• Construction of well-formed Petri nets from standard subnets
• Behavior relativity of Petri nets.
• Deadlock prevention policy based on Petri nets and siphons
• scientific article; zbMATH DE number 4014040 (Why is no real title available?)
• Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
• A new methodology for analyzing distributed systems modeled by petri nets
• scientific article; zbMATH DE number 4113945 (Why is no real title available?)
• scientific article; zbMATH DE number 2112417 (Why is no real title available?)
• Applications and Theory of Petri Nets 2005
• High-level Petri-net model for a resource-sharing problem

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

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