A tabular method for the analysis of large petri nets

DOI10.1080/00207169008803877MaRDI QIDQ3477973zbMATH OpenOpenAlexFDO

Authors Hossam Mahmoud Ahmad Fahmy

Publication date 1990

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

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

zbMATH Keywords

Petri netsmatrix equationsreachability treeanalysis techniques

Mathematics Subject Classification ID

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

Recommendations

• Analysis of petri nets by partitioning: splitting places or transitions
• Analysis of Petri nets by partitioning: Splitting transitions
• Compositional analysis of Petri nets
• Dynamic analysis of Petri net-based discrete systems
• Modular Analysis of Petri Nets

Cites work

• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• Circuit theoretic analysis and synthesis of marked graphs
• State equation, controllability, and maximal matchings of petri nets
• Termination Properties of Generalized Petri Nets

Cited in

(5)

• scientific article; zbMATH DE number 1192962 (Why is no real title available?)
• Analysis of petri nets by partitioning: splitting places or transitions
• Compositional analysis of Petri nets
• Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks
• Dynamic feature research into simplifying technology of Petri nets

This page was built for publication: A tabular method for the analysis of large petri nets

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