Reachability and firing sequences of homogeneous synchronized choice petri nets

Journal of Information Science and Engineering

Volumn 21, Issue 1, 2005, Pages 129-152

  Chao, Daniel Y ^a  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

Inconsistent pair; Liveness; Petri nets; Reachability; Synchronized choice nets; Synthesis; Verification

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

INCONSISTENT PAIR; LIVENESS; REACHABILITY; SYNCHRONIZED CHOICE NETS; SYNTHESIS; VERIFICATION;

PETRI NETS;

EID: 12744251572     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. K. Barkaoui, J. M. Couvreur, and C. Dutheillet, "On liveness in extended non self-controlling nets," in Proceedings of 16th International Conference on Application and Theory of Petri Nets 1995, LNCS, No. 935, Springer-Verlag, 1995, pp. 25-44.
2. D. Y. Chao, "Extended synchronized choice nets," The Computer Journal, Vol. 46, 2003, pp. 505-523.
3. D. Y. Chao, "Reachability of non-synchronized choice petri nets with resource-sharing," in Proceedings of IEEE International Conference on Systems, Man and Cybernetics (SMC '02), Vol. 5, 2002.
4. D. Y. Chao and J. A. Nicdao, "Liveness for synchronized choice petri nets," The Computer Journal, Vol. 44, 2001, pp. 124-136.
5. D. Y. Chao and D. T. Wang, "Two theoretical and practical aspects of knitting technique - invariants and a new class of petri net," IEEE Transactions on Systems, Man and Cybernetics, Vol. 27, 1997, pp. 962-977.
6. G. Ding and T. Sekiguchi, "A method of determining the firing sequence of petri net," Transactions of the Society of Instrument and Control Engineers, Vol. 25, 1989, pp. 698-705.
7. J. Desel and J. Esparza, "Shortest paths in reachability graphs," in M. A. Marsan, LNCS, Vol. 691, Application and Theory of Petri Nets 1993, Proceedings 14th International Conference, Chicago, Illinois, pp. 224-241, Springer-Verlag, 1993. Also in Journal of Computer and System Sciences, Vol 51, 1995, pp. 314-323.
8. J. Desel and J. Esparza, "Shortest paths in reachability graphs," in M. A. Marsan, LNCS, Vol. 691, Application and Theory of Petri Nets 1993, Proceedings 14th International Conference, Chicago, Illinois, pp. 224-241, Springer-Verlag, 1993. Also in Journal of Computer and System Sciences, Vol 51, 1995, pp. 314-323.
9. D. I. Lee, S. Kumagai, and S. Kodama, "Handles and reachability analysis of free choice nets," in Proceedings of International Conference on Application and Theory of Petri Nets, LNCS, No. 935, Springer-Verlag, 1995, pp. 298-316.
10. R. J. Lipton, "The reachability problem requires exponential space," Research Report No. 62, Dept. of Computer Science, Yale University, 1976.
11. T. Murata, N. Komoda, and K. Matsumoto, "A petri net based controller for flexible and maintainable sequence control and its applications in factory automation," IEEE Transactions on Industrial Electronics, Vol. IE-33, 1986, pp. 1-8.