Analysis of petri nets by partitioning: splitting places or transitions

References

• Peterson , J. L. 1981 . Petri Net Theory and the Modeling of Systems , Englewood Cliffs, N.J : Prentice Hall Inc. .
   Google Scholar
• Fahmy H. M. A. On the Analysis Techniques of Petri Net Models, 14th International Conference for Statistics Computer Science Social and Demographic Research, Ain-Shams University Cairo, Egypt 1989
   Google Scholar
• Fahmy , H. M. A. 1990 . A Tabular Method for the Analysis of Large Petri Nets . International Journal of Computer Mathematics , 34 : 205 – 214 .
   Google Scholar
• Fahmy , H. M. A. 1990 . Analysis of Petri nets by partitioning: Splitting Transitions . Theoretical Computer Science , 77 : 321 – 330 . France
   Google Scholar
• Hack , M. . The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems . Proceedings of the 15th Annual Symposium on Switching and Automata Theory . New York. pp. 156 – 164 . IEEE .
   Google Scholar
• Lien , Y. 1976 . Termination properties of generalized Petri nets . SIAM Journal of Computing , 5 ( 2 ) : 251 – 265 .
   Google Scholar
• Murata , T. 1977 . State equations, controlability and maximal matchings of Petri nets . IEEE Trans. on Automatic Control , 22 ( 3 ) : 412 – 416 .
   Web of Science ®Google Scholar
• Murata , T. 1977 . Petri nets, marked graphs, and circuit system theory . IEEE Circuits and Systems Society Newsletter , 11 ( 3 ) : 2 – 12 .
   Google Scholar
• Murata , T. 1977 . Circuit theoretic analysis and synthesis of marked graphs . IEEE Trans. on Circuits and Systems , 24 ( 7 ) : 400 – 405 .
   Google Scholar