A generalized approach to supervisor synthesis

Proceedings - 1st ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE 2003

Volumn , Issue , 2003, Pages 217-226

  Ziller, R ^a   Schneider, K ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b University of Koblenz Landau   (Germany)

Author keywords

Automata; Automatic control; Computational complexity; Computer science; Control system synthesis; Controllability; Equations; Error correction; Fault tolerance; Supervisory control

Indexed keywords

AUTOMATION; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER CONTROL SYSTEMS; COMPUTER SCIENCE; CONTROL; CONTROLLABILITY; ERROR CORRECTION; FAULT TOLERANCE; FORMAL METHODS; MODEL CHECKING; PROBLEM SOLVING; SYNTHESIS (CHEMICAL); TEMPORAL LOGIC; TRANSPORTATION;

ACCESSIBILITY REQUIREMENTS; AUTOMATA; EQUATIONS; FAIRNESS CONSTRAINTS; MU-CALCULUS; SUPERVISORY CONTROL; SYNTHESIS PROBLEMS;

CONTROL SYSTEM SYNTHESIS;

EID: 34547464238     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MEMCOD.2003.1210106     Document Type: Conference Paper

References (20)

1. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial observation. http://www.labri.fr/Perso/~vincent/Research/publications.html, 2002.
2. 20 States and Beyond. In Proc. LICS, 1990.
3. C. G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Kluwer Academic Publishers, Boston, U.S.A., 1999. ISBN 0-7923-8609-4.
4. E. M. Clarke, Jr, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, London, U.K., 1999. ISBN 0-262-03270-8.
5. R. Cleaveland, M. Klein, and B. Steffen. Faster Model Checking for the Modal μ-Calculus. InD. P. G.v. Bochmann, editor, Computer Aided Verification (CAV'92), volume 663ofLNCS, pages 410-422, Heidelberg, Germany, 1992. Springer-Verlag.
6. E. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In IEEE Symposium on Logic in Computer Science (LICS), pages 267-278, Washington, D.C., 1986. IEEE Computer Society Press.
7. E. A. Emerson, C. S. Jutla, and P. Sistla. On model-checking for fragments of μ-calculus. InC. Courcoubetis, editor, Computer Aided Verification, volume 697 of LNCS, pages 385-396, Elounda, Greece, 1993. Springer Verlag.
8. R. Kumar and V. Garg. Modeling and Control of Logical Discrete Event Systems. Kluwer Academic Publishers, 1995. ISBN 0-7923-9538-7.
9. J.-L. Lassez, V. Nguyen, and E. Sonenberg. Fixed point theorems and semantics: a folk tale. Information Processing Letters, 14(3):112-116, May 1982.
10. D. Niwinski. On fixed point clones. InInternational Colloquium on Automata, Languages and Programming (ICALP), pages 464-473. L. Kott, Ed., vol 226 of LNCS, Springer-Verlag, 1986.
11. P. J. Ramadge and W. M. Wonham. Supervisory control of a class of discrete event processes. SIAM J. of Control and Optimization, 25(1):206-230, 1987.
12. P. J. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1):81-98, 1989.
13. K. Schneider. Verification of Reactive Systems - Algorithms and Formal Methods. EATCS Texts. Springer, 2003.
14. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5(2):285-309, 1955.
15. J. G. Thistle and W. M. Wonham. Control of infinite behavior of finite automata. SIAM J. of Control and Optimization, 32(4):1075-1097, 1994.
16. J. G. Thistle and W. M. Wonham. Supervision of infinite behavior of discrete-event systems. SIAM J. of Control and Optimization, 32(4):1098-1113, 1994.
17. Th. Wilke. Alternating Tree Automata, Parity Games, and Modal μ-Calculus. Bull. Soc. Math. Belg., 8(2), May 2001.
18. W. M. Wonham. Notes on control of discrete-event systems. Technical report, Dept. of Electrical and Computer Engineering, University of Toronto, Jul. 2002. Available at http://www.control.utoronto.ca/DES.
19. W. M. Wonham and P. Ramadge. On the supremal controllable sulanguange of a given language. SIAM J. Control and Optimization, 25(3):637-659, May 1987.
20. R. M. Ziller and K. Schneider. A μ-Calculus Approach to Supervisor Synthesis. In GI/ITG/GMM-Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, pages 132-143, 2003.