Analysis of petri nets by partitioning: splitting places or transitions

DOI10.1080/00207169308804196zbMATH Open0797.68126OpenAlexW1989457626MaRDI QIDQ4285645FDOQ4285645

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

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

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)

Cites Work

• Title not available (Why is that?)
• Termination Properties of Generalized Petri Nets
• State equation, controllability, and maximal matchings of petri nets
• Circuit theoretic analysis and synthesis of marked graphs
• Analysis of Petri nets by partitioning: Splitting transitions
• A tabular method for the analysis of large petri nets

Cited In (4)

• A tabular method for the analysis of large petri nets
• Modular Analysis of Petri Nets
• Analysis of Petri nets by partitioning: Splitting transitions
• 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)