On the Regularity of Petri Net Languages

Information and Computation

Volumn 124, Issue 2, 1996, Pages 168-181

  Yen, Hsu Chun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040591555     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0013     Document Type: Article

References (29)

1. Agerwala, T., and Flynn, M. (1973), Comments on capabilities, limitations and 'correctness' of Petri nets, in "Proceedings, 1st Annual Symposium on Computer Architecture," pp. 81-86.
2. Christensen, S., Hirshfeld, Y., and Moller, F. (1993), Bisimulation equivalence is decidable for basic parallel processes, in "Proceedings, 4th International Conference on Concurrency Theory," pp. 143-157.
3. Esparza, J. (1992), A solution to the covering problem for 1-bounded conflict-free Petri nets, Inform. Process. Lett. 41, 313-319.
4. Esparza, J. (1994), "On the Uniform Word Problem for Commutative Context-Free Grammars," Technical Report, Laboratory of Foundations of Computer Science, University of Edinburgh.
5. Ginzburg, A., and Yoeli, M. (1980), Vector addition systems and regular languages, J. Comput. System Sci. 20, 277-284.
6. Hopcroft, J., and Ullman, J. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
7. Howell, R., and Rosier, L. (1988), Completeness results for conflict-free vector replacement systems, J. Comput. System Sci. 37, 349-366.
8. 1.5) algorithm to decide boundedness for conflict-free vector replacement systems, Inform. Process. Lett. 25, 27-33.
9. Howell, R., Rosier, L., and Yen, H. (1993), Normal and sinkless Petri nets, J. Comput. System Sci. 46, 1-26.
10. Huynh, D. (1983), Commutative grammars: The complexity of uniform word problems, Inform, and Control 57, 21-39.
11. Ichikawa, A., and Hiraishi, K. (1987), Analysis and control of discrete event systems represented by Petri nets, in "Lecture Notes in Control and Information Science," Vol. 103, pp. 115-134, Springer-Verlag, Berlin/New York.
12. Jantzen, M., and Petersen, H. (1994), Cancellation in context-free languages: Enrichment by induction, Theoret. Comput. Sci. 127, 149-170.
13. Jones, N., Landweber, L., and Lien, Y. (1977), Complexity of some problems in Petri nets, Theoret. Comput. Sci. 4, 277-299.
14. Khachian, L. (1979), A polynomial algorithm for linear programming, Dokl. Akad. Nauk USSR 244, 1093-1096, translated in Sov. Math. Dokl. 20, 191-194.
15. Khachian, L. (1979), A polynomial algorithm for linear programming, Dokl. Akad. Nauk USSR 244, 1093-1096, translated in Sov. Math. Dokl. 20, 191-194.
16. Kosaraju, R. (1973), Limitations of Dijkstra's semaphore primitives and Petri nets, Oper. Systems Rev. 7, 122-126.
17. Landweber, L., and Robertson, E. (1978), Properties of conflict-free and persistent Petri nets, J. Assoc. Comput. Mach. 25, 352-364.
18. Lenstra, H., Jr. (1983), Integer programming with a fixed number of variables, Math. Oper. Res. 8, 538-548.
19. Lipton, R. (1976), "The Reachability Problem Requires Exponential Space," Technical Report 62, Dept. of Computer Science, Yale University.
20. Murata, T. (1989), Petri nets: Properties, analysis and applications, Proc. IEEE 77, 541-580.
21. Peterson, J. (1981), "Petri Net Theory and the Modeling of Systems," Prentice-Hall International, Englewood Cliffs, NJ.
22. Reisig, W. (1985), "Petri Nets: An Introduction," Springer-Verlag, Heidelberg.
23. Schwer, S. (1986), On the rationality of Petri net languages, Inform. Process. Lett. 22, 145-146.
24. Schwer, S. (1992a), Fine covers of a VAS language, Theoret. Comput. Sci. 95, 159-168.
25. Schwer, S. (1992b), The context-freeness of the languages associated with vector addition systems is decidable, Theoret. Comput. Sci. 98, 199-247.
26. Valk, R., and Vidal-Naquet, G. (1981), Petri nets and regular languages, J. Comput. System Sci. 23, 299-325.
27. Yamasaki, H. (1984), Normal Petri nets, Theoret. Comput. Sci. 31, 307-315.
28. Yen, H. (1991), A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets, Inform. Process. Lett. 38, 71-76.
29. Yen, H. (1992), A unified approach for deciding the existence of certain Petri net paths, Inform. and Comput. 96, 119-137.