A new methodology for analyzing distributed systems modeled by petri nets

DOI10.1080/00207169008803798zbMath0825.68182OpenAlexW2049282611MaRDI QIDQ4009710

Sajal K. Das, Lalit M. Patnaik, Vinod K. Agrawal, Dilip Sarkar

Publication date: 27 September 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803798

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Hierarchical reduction method for analysis and decomposition of Petri nets
• Synthesis of a Class of Deadlock-Free Petri Nets
• Reflexive Incidence Matrx (RIM) Representation of Petri Nets
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Formal verification of parallel programs

This page was built for publication: A new methodology for analyzing distributed systems modeled by petri nets