Analysis of petri nets by partitioning: splitting places or transitions

DOI10.1080/00207169308804196zbMath0797.68126OpenAlexW1989457626MaRDI QIDQ4285645

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)

Cites Work

• Unnamed Item
• Analysis of Petri nets by partitioning: Splitting transitions
• A tabular method for the analysis of large petri nets
• Termination Properties of Generalized Petri Nets
• State equation, controllability, and maximal matchings of petri nets
• Circuit theoretic analysis and synthesis of marked graphs

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