Bisimulation, the supervisory control problem and strong model matching for finite state machines

Discrete Event Dynamic Systems: Theory and Applications

Volumn 8, Issue 4, 1998, Pages 377-429

  Barrett, George ^a   Lafortune, Stéphane ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Bisimulation; Controllability; Model matching; Supervisory control

Indexed keywords

BISIMULATION; FINITE STATE MACHINES; MODEL MATCHING; SUPERVISORY CONTROL;

ALGORITHMS; AUTOMATA THEORY; CONTROL SYSTEM ANALYSIS; DISCRETE TIME CONTROL SYSTEMS; PATTERN MATCHING; SCADA SYSTEMS; SEMANTICS; COMPUTER SIMULATION; CONTROL THEORY; CONTROLLABILITY; SEQUENTIAL MACHINES;

PROBLEM SOLVING; FINITE AUTOMATA;

BISIMULATION; MODEL MATCHING; SUPERVISORY CONTROL THEORY;

EID: 0032296161     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008301317459     Document Type: Article

References (28)

1. Arnold, A. 1994. Finite Transition Systems. NJ: Prentice Hall.
2. Baeten, J. C. M., and Weijland, W. P. 1990. Process algebra. Cambridge Tracts in Theoretical Computer Science 18.
3. Barrett, G., and Lafortune, S. 1996. A bisimulation approach to the supervisory control of discrete event systems. Proc. of 34th Annual Allerton Conference on Communication, Control and Computing. Allerton Park, IL.
4. Barrett, G., and Lafortune, S. 1997. Using bisimulation to solve discrete event control problems. Proc. 1997 American Control Conf. Albuquerque, NM, pp. 2337-2341.
5. Bloom, B., Istrail, S., and Meyer, A. 1988. Bisimulation can't be traced: Preliminary report. Proc. of 15th Annual SIGACT-SIGPLAN Symposium on Principles of Programming Languages.
6. Cassandras, C., Lafortune, S., and Olsder, G. 1995. Introduction to the modelling, control and optimization of discrete event systems. Trends in Control. A European Perspective. A. Isidori, ed., Springer-Verlag, pp. 217-291.
7. DiBenedetto, M. D., Saldanha, A., and Sangiovanni-Vincentelli, A. 1994. Model matching for finite state machines. Proc. of 33rd Conf. Decision and Control. Lake Buena Vista, FL. pp. 3117-3124.
8. DiBenedetto, M. D., Saldanha, A., and Sangiovanni-Vincentelli, A. 1995. Strong model matching for finite state machines. Proc. of 3rd European Control Conference. Rome, Italy, pp. 2027-2034.
9. DiBenedetto, M. D., Saldanha, A., and Sangiovanni-Vincentelli, A. 1995. Strong model matching for finite state machines with non-deterministic reference model. Proc. of 34rd Conf. Decision and Control. New Orleans, LA. pp. 422-426.
10. DiBenedetto, M. D., Saldanha, A., and Sangiovanni-Vincentelli, A. 1996. Model matching for finite state machines. Cadence Berkeley Laboratories Technical Report.
11. Fabian, M. 1995. On object oriented nondeterministic supervisory control. Ph.D. thesis, Chalmers University of Technology.
12. Fernandez, J. 1990. An implementation of an efficient algorithm for bisimulation equivalence. Sci. Comput. Programming 13: 219-236.
13. Fernandez, J. 1996. Personal communications.
14. Hadj-Alouane, N. B., Lafortune, S., and Lin, F. 1994. Variable lookahead supervisory control with state information. IEEE Trans. Automat. Contr. 39-12: 2398-2410.
15. Hayes, J. P. 1993. Introduction to Digital Logic Design. Reading, MA: Addison-Wesley.
16. Heymann, M., and Lin, F. 1996. Discrete event control of nondeterministic systems. Tech, Report # CIS 9601, Department of Computer Science Technion, Israel Institute of Technology.
17. Heymann, M., and Meyer, G. 1991. An algebra of discrete event processes. Tech. Report NASA Memorandum 102848. NASA, Ames Research Center, Moffett Field, CA.
18. Inan, K. 1994. Nondeterministic supervision under partial observation, 11th International Conference on Analysis and Optimization of Systems: Discrete Event Systems. G. Cohen and J. Quadrat, eds., Springer-Verlag, pp. 39-48.
19. Kohavi, Z. 1978. Switching and Finite Automata Theory, 2nd ed. New York: McGraw-Hill.
20. Kumar, R., Garg, V., and Marcus, S. I. On controllability and normality of discrete-event dynamical systems. Syst. Contr. Lett. 17: 157-168.
21. Overkamp, A. 1997. Supervisory control using failure semantics and partial specifications. IEEE Trans. Automat. Contr.42-4: 498-510.
22. Paige, R., and Tarjan, R. 1987. Three partition refinement algorithms. SIAM J. Comput. 16-6: 973-989.
23. Ramadge, P. J., and Wonham, W. M. 1987. Supervisory control of a class of discrete event processes. SIAM J. Control Optim. 25-1: 206-230.
24. Ramadge, P. J., and Wonham, W. M. 1989. The control of discrete event systems. Proc. of the IEEE 77-1: 81-98.
25. Sangiovanni-Vincentelli, A. 1995. Personal communications.
26. Shayman, M., and Kumar, R. 1995. Supervisory control of nondeterministic systems with driven events via prioritized synchronization and trajectory models. SIAM J. Control Optim. 33-2: 469-497.
27. Thistle, J. G., Malhamé, R. P., Hoang, H. H., and Lafortune, S.1995. Blocking, modularity, and feature interactions in distributed systems. Preprint.
28. Wonham, W. M., and Ramadge, P. J. 1987. On the supremal controllable sublanguage of a given language. SIAM J. Control Optim. 25-3: 637-659.