Analysis of Petri nets by partitioning: Splitting transitions

DOI10.1016/0304-3975(90)90174-GMaRDI QIDQ751853zbMATH OpenFDO

Authors Hossam Mahmoud Ahmad Fahmy

Publication date 1990

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(90)90174-G

zbMATH Keywords

partitioningPetri nets

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
• Using transition set sequences to partition behaviors of Petri nets
• Analysis of Petri nets and transition systems
• scientific article; zbMATH DE number 4074502
• Compositional analysis of Petri nets
• Decomposition of Petri nets
• Modular Analysis of Petri Nets
• Structural analysis of Petri nets

Cites work

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

Cited in

(4)

• Dynamic feature research into simplifying technology of Petri nets
• A tabular method for the analysis of large petri nets
• Analysis of petri nets by partitioning: splitting places or transitions
• scientific article; zbMATH DE number 1487617 (Why is no real title available?)

This page was built for publication: Analysis of Petri nets by partitioning: Splitting transitions

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