On asymptotically efficient solutions for a class of supervisory control problems

IEEE Transactions on Automatic Control

Volumn 41, Issue 12, 1996, Pages 1736-1750

  Sreenivas, Ramavarapu S ^a,b  

^a IEEE

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DISCRETE TIME CONTROL SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

FORBIDDEN STATE PROBLEMS; FORBIDDEN STRING PROBLEMS; LIMITING PROBLEM; STORAGE REQUIREMENT;

SCADA SYSTEMS;

EID: 0030421031     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.545713     Document Type: Article

References (39)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. New York: North-Holland, 1976.
2. R. Cieslak, C. Desclaux, A. S. Fawaz and P. Varaiya, "Supervisory control of discrete event processes with partial observations," IEEE Trans. Automat. Contr., vol. 33, no. 3, pp. 249-260, Mar. 1988.
3. R. A. Cieslak and P. P. Varaiya, "Undecidability results for deterministic communicating sequential processes," IEEE Trans. Automat. Contr., vol. 35, no. 9, pp. 1032-1039, Sept. 1990.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
5. A. Giua and F. DiCesare, "Decidability and closure properties of weak Petri net languages and supervisory control," IEEE Trans. Automat. Contr., vol. 40, no. 5, pp. 906-910, May 1995.
6. M. H. T. Hack, "The recursive equivalence of the reachability problem and the liveness problem for Petri nets and Vector addition systems," in Proc. 15th Annu. Symp. Switching Automata Theory, New Orleans, LA, Oct. 1974, pp. 156-164.
7. _, "Petri net languages," Massachusetts Inst. Technol., Tech. Rep. 159, Mar. 1976.
8. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison Wesley, 1979.
9. K. Inan and P. Varaiya, "Finitely recursive process models for discrete event systems," IEEE Trans. Automat. Contr., vol., 33, no. 7, pp. 626-639, July 1988.
10. N. D. Jones, L. H. Landweber, and Y. E. Lien, "Complexity of some problems in Petri nets," Theoretical Computer Sci., vol. 4, pp. 277-299, 1977.
11. S. R. Kosaraju, "Decidability of reachability in vector addition systems," in Proc. 14th Annu. Symp. Theory Computing, 1982, pp. 267-281.
12. R. Kumar, V. Garg, and S. I. Marcus, "On the controllability and normality of discrete event dynamical systems," Syst. Contr. Lett., vol. 17, pp. 157-168, 1991.
13. Y. Li and W. M. Wonham, "Control of vector discrete-event systems I - The base model," IEEE Trans. Automat. Contr., vol. 38, no. 8, pp. 1214-1227, Aug. 1993.
14. _, "Control of vector discrete-event systems II - Controller synthesis," IEEE Trans. Automat. Contr., vol. 39, no. 3, pp. 512-531, Mar. 1994.
15. R. Lipton, "The reachability problem requires exponential space," Dept. Computer Sci., Yale Univ., Tech. Rep., Res. Rep. 62, Jan. 1976.
16. Y. V. Matiyasevich, Hilbert's Tenth Problem. Cambridge, MA: MIT Press, 1993.
17. E. W. Mayr, "An algorithm for the general Petri net reachability problem," SIAM J. Computing, pp. 441-460, 1984.
18. T. Murata, "Petri nets: Properties, analysis and applications," Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
19. E. Pelz, "Closure properties of deterministic Petri nets," in Proc. STACS, 1987, pp. 371-382;
20. also Lecture Notes in Computer Science, vol. 247. Berlin: Springer-Verlag.
21. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
22. P. J. Ramadge and W. M. Wonham, "Modular supervisory control of discrete event systems," in Proc. Seventh Int. Conf. Analysis Optimization Syst., Antibes, June 25-27, 1986, pp. 202-214;
23. also Lecture Notes in Control and Optimization of Systems, vol. 83, A. Bensoussan and J. L. Lions, Eds. New York: Springer-Verlag, 1986.
24. _, "Modular feedback logic for discrete event systems," SIAM J. Contr. Optimization, vol. 25, no. 5, pp. 1202-1218, Sept. 1987.
25. _, "Supervisory control of class of discrete event processes," SIAM J. Contr. Optimization, vol. 25, no. 1, pp. 206-230, Jan. 1987.
26. _, "The control of discrete event systems," Proc. IEEE, vol. 77, no. 1, pp. 81-98, Jan. 1989.
27. C. Reutenauer, The Mathematics of Petri Nets. Hertforshire, U.K.: Masson and Prentice-Hall Int., 1990;
28. originally published under the title Aspects mathématiques des réseaux de Pétri.
29. H. A. Sanghavi, "A software library for discrete event systems and other finite state machine based applications," Master's thesis, Univ. Texas, Electrical and Computer Engineering Dept., Austin, TX, Aug. 1991.
30. R. Smedinga, "Using trace theory to model discrete events," in Discrete Event Systems: Models and Applications, vol. 103, in Lecture Notes in Control and Information Sciences. Berlin: Springer-Verlag, 1987, pp. 81-99.
31. R. S. Sreenivas, "Deterministic λ-free petri net languages and their application to the supervisory control of discrete event dynamic systems," in Proc. 36th Midwest Symp. Circuits Syst., Detroit, MI, Aug. 1993.
32. _, "A note on deciding the controllability of a language K with respect to a language L," IEEE Trans. Automat. Contr., vol. 38, no. 4, pp. 658-662, Apr. 1993.
33. _, "On a weaker notion of controllability of a language K with respect to a language L," IEEE Trans. Automat. Contr., vol. 38, no. 9, pp. 1446-1447, Sept. 1993.
34. _, "On the existence of finite state supervisors for arbitrary supervisory control problems," IEEE Trans. Automat. Contr., vol. 39, no. 4, pp. 856-861, Apr. 1994.
35. R. S. Sreenivas and B. H. Krogh, "On Petri net models of infinite state supervisors," IEEE Trans. Automat. Contr., vol. 37, no. 2, pp. 274-277, Feb. 1992.
36. T. Ushio, "A necessary and sufficient condition for the existence of finite state supervisors in discrete-event systems," IEEE Trans. Automat. Contr., vol. 38, no. 1, pp. 135-138, Jan. 1993.
37. A. F. Vaz and W. M. Wonham, "On supervisor reduction in discrete-event systems," Int. J. Contr., vol. 44, no. 2, pp, 475-491, 1986.
38. R. G. Willson, "A control separation approach to the specification and analysis of discrete state systems and controllers," Master's thesis, Dept. Electrical and Computer Engineering and Robotics Institute, Carnegie Mellon Univ., Apr. 1988.
39. W. M. Wonham and P. J. Ramadge, "On the supremal controllable sublanguage of a given language," SIAM J. Contr. Optimization, vol. 25, no. 3, pp. 637-659, May 1987.