On minimal representations of Petri net languages

IEEE Transactions on Automatic Control

Volumn 51, Issue 5, 2006, Pages 799-804

  Sreenivas, Ramavarapu S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Discrete event systems; Petri nets; Supervisory control

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONTROLLABILITY; OPTIMIZATION;

DISCRETE-EVENT SYSTEMS; PETRI NET LANGUAGES; SUPERVISORY CONTROL;

PETRI NETS;

EID: 33646943797     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2006.875026     Document Type: Article

References (19)

1. B. S. Baker and R. V. Book, "Reversal-bounded multipushdown machines," J. Comput. Syst. Sci., vol. 8, pp. 315-332, 1974.
2. m," J. Comput. Syst. Sci., vol. 59, pp. 373-391, 1999.
3. S. A. Greibach, "Remarks on blind and partially blind one-way multicounter machines," Theoret. Comput. Sci., vol. 7, pp. 311-324, 1978.
4. M. H. T. Hack, "Petri net languages," Mass. Inst. Technol., Cambridge, MA, Tech. Rep. 159, 1976.
5. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979, Series in Computer Science.
6. P. Jančar, J. Esparza, and F. Moller, "Petri nets and regular processes," J. Comput. Syst. Sci., vol. 59, pp. 476-503, 1999.
7. N. D. Jones, L. H. Landweber, and Y. E. Lien, "Complexity of some problems in Petri nets," Theoret. Comput. Sci., vol. 4, pp. 277-299, 1977.
8. S. R. Kosaraju, Decidability Reachability Vector Addition Syst., pp. 267-281, 1982.
9. J. P. Lewis, "Large limits to software estimation," ACM Software Eng. Notes, vol. 26, no. 4, pp. 54-59, Jul. 2001.
10. M. Li and P. Vitànyi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed. New York: Springer-Verlag, 1997, Graduate Texts in Computer Science.
11. E. W. Mayr, "An algorithm for the general Petri net reachability problem," SIAM J. Comput., vol. 13, pp. 441-460, 1984.
12. E. Pelz, "Closure properties of deterministic Petri nets," in STACS 87. Berlin, Germany: Springer-Verlag, 1987, vol. 247, Lecture Notes in Computer Science, pp. 371-382.
13. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
14. C. Rackoff, "The covering and boundedness problems for vector addition systems," Theoret. Comput. Sci., vol. 6, no. 2, pp. 223-231, Apr. 1978.
15. P. J. G. Ramadge and W. M. Wonham, "The control of discrete event systems," Proc. IEEE, vol. 77, no. 1, pp. 81-98, Jan. 1989.
16. R. S. Sreenivas, "On a weaker notion of controllability of a language K with respect to a language L," IEEE Trans. Autom. Control, vol. 38, no. 9, pp. 1446-1447, Sep. 1993.
17. R. S. Screenivas, "On asympotically efficient solutions for a class of supervisory control problems," IEEE Trans. Autom. Control, vol. 41, no. 12, pp. 1736-1750, Dec. 1996.
18. R. S. Screenivas, "On minimal representations of Petri net languages: Theory and illustrative examples," Univ. Illinois at Urbana-Champaign, Coordinated Science Laboratory, Urbana, IL, Res. Rep. UILU-ENG 05-2202, 2005.
19. R. Valk and G. Vidal-Naquet, "Petri nets and regular languages," J. Comput. Syst. Sci., vol. 3, pp. 299-325, 1981.