Analysis of petri nets by partitioning: splitting places or transitions

DOI10.1080/00207169308804196MaRDI QIDQ4285645zbMATH OpenOpenAlexFDO

Authors Hossam Mahmoud Ahmad Fahmy

Publication date 19 October 1994

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

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

zbMATH Keywords

Petri netsmatrix equationsreachability treeproblem size

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 transitions
• A tabular method for the analysis of large petri nets
• Modular Analysis of Petri Nets
• Decomposition of Petri nets
• Compositional analysis of Petri nets

Cites work

• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• A tabular method for the analysis of large petri nets
• Analysis of Petri nets by partitioning: Splitting transitions
• 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

(4)

• Analysis of Petri nets by partitioning: Splitting transitions
• Modular Analysis of Petri Nets
• A tabular method for the analysis of large petri nets
• Dynamic feature research into simplifying technology of Petri nets

This page was built for publication: Analysis of petri nets by partitioning: splitting places or transitions

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