Efficient supervisory synthesis of large systems

Control Engineering Practice

Volumn 14, Issue 10, 2006, Pages 1157-1167

  Vahidi, Arash ^a   Fabian, Martin ^a   Lennartson, Bengt ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Binary decision diagrams; Discrete event systems; Reachability search; Supervisory control; Symbolic computation

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; HEURISTIC METHODS; MATHEMATICAL MODELS; STATE SPACE METHODS;

BINARY DECISION DIAGRAMS; DISCRETE EVENT SYSTEMS; REACHABILITY SEARCH; SUPERVISORY CONTROL; SYMBOLIC COMPUTATION;

LARGE SCALE SYSTEMS;

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; HEURISTIC METHODS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; STATE SPACE METHODS;

EID: 33744906311     PISSN: 09670661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.conengprac.2006.02.013     Document Type: Article

References (39)

1. Akers S.B. Binary decision diagrams. IEEE Transactions on Computers 27 6 (1978) 509-516
2. Åkesson, K., Flordal, H., & Fabian, M. (2002). Exploiting modularity for synthesis and verification of supervisors. In Proceedings of the 15th triennial world congress of the international federation of automatic control, Barcelona, Spain.
3. Aziz, A., & Taziran, S. (1994). BDD variable ordering for interacting finite state machines. In Proceedings of the 31th design automation conference (pp. 283-288).
4. Balemi S., Hoffmann G.J., Gyugyi P., Wong-Toi H., and Franklin G.F. Supervisory control of a rapid thermal multiprocessor. IEEE Transactions on Automatic Control 38 (1993) 1040-1059
5. Bollig, B., & Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers.
6. Brandin, B. A., & Charbonnier, F. E. (1994). The supervisory control of the automated manufacturing system of the aip. In Proceedings of fourth international conference on computer integrated manufacturing and automation technology (pp. 319-324).
7. Brandin B.A., Malik R., and Dietrich P. Incremental system verification and synthesis of minimally restrictive behaviors. Control Systems Technology, IEEE Transactions on 12 3 (2004) 387-401
8. Brezocnik, Z., Casar, A., & Kapus, T. (1996). Efficient symbolic traversal algorithms using partitioned transition relations. In Proceedings of COST 247 international workshop on applied formal methods in system design, Slovenia (pp. 146-155).
9. Bryant R.E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24 3 (1992) 293-318
10. Burch, J. R., Edmund, M. C., & David, E. L. (1991). Symbolic model checking with partitioned transition relations. In A. Halaas, & P.B. Denyer, (Eds.), Proceedings of 1991 international conference on VLSI.
11. Burch J.R., Edmund M.C., David E.L., Kenneth L.M., and David L.D. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 3 4 (1994) 401-424
12. Cheng C., and Kuh E. Module placement based on resistive network optimization. IEEE Transactions on CAD 3 7 (1984) 218-225
13. Cousot P., and Cousot R. Constructive versions of Tarski's fixed point theorems. Pacific Journal of Mathematics 82 (1979) 43-57
14. de Queiroz, M. H., & Cury, J. E. R. (2000). Modular supervisory control of large scale discrete event systems. Discrete Event Systems, Analysis and Control, 103-110.
15. Dijkstra, E. W. (1972). Hierarchical ordering of sequential processes. Operating Systems Techniques, 72-93.
16. Geldenhuys J., and Valmari A. Techniques for smaller intermediary BDDs. The 12th international conference on concurrency theory, lecture notes in computer science (Vol. 2154) (2001), Springer, Berlin 233-247
17. Gunnarsson, J. (1997). Symbolic methods and tools for discrete event dynamic systems. Ph.D. thesis. Linköping University. Sweden.
18. Heiner, M. (1997). Verification and optimization of control programs by petri nets without state explosion. In Proceedings of the second international workshop on manufacturing and petri nets held at international conference on application and theory of petri nets, Toulouse (pp. 69-84).
19. Hoare C.A.R. Communicating sequential processes (1985), Prentice-Hall International Series in Computer Science, Englewood Cliffs, NJ
20. Hoffmann, G., & Wong-Toi, H. (1992). Symbolic synthesis of supervisory controllers. In Proceedings of 1992 American control conference. Chicago, IL, USA. (pp. 2789-2793).
21. Hojati, R., Krishnan, S., & Brayton, R. (1996). Early quantification and partitioned transition relation. In Proceedings of IEEE international conference on computer design (pp. 12-19).
22. Hopcroft J.E., Motwani R., and Ullman J.D. Introduction to automata theory, languages, and computation (2001), Addison-Wesley, Reading, MA
23. Hu, A. J. (1995). Techniques for efficient formal verification using binary decision diagrams. Ph.D. thesis, Carnegie Mellon University.
24. Huttunen, A., & Härsjö, M. (2003). Control and simulation of a customer driven large-scale manufacturing system. Master thesis, EX041/2003, Chalmers University of Technology.
25. Kaelbling L.P., Michael L.L., and Andrew P.M. Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4 (1996) 237-285
26. Leduc, R. J. (2002). Hierarchical interface based supervisory control. Ph.D. thesis, Department of Electrical and Computer Engineering, University of Toronto.
27. Lee C. Representation of switching circuits by binary decision programs. Bell System Technology Journal 38 (1959) 985-999
28. Malik R., and Mühlfeld R. A case study in verification of UML statecharts: The PROFIsafe protocol. Journal of Universal Computer Science 9 2 (2003) 138-151
29. Marchand, H., & Pinchinat, S. (2000). Supervisory control problem using symbolic bisimulation techniques. In Proceedings of the 2000 American control conference (Vol. 6) (pp. 4067-4071).
30. Pastor E., Roig O., Cortadella O.R.J., and Rosa M.B. Petri net analysis using boolean manipulation. In: Valette R. (Ed). Proceedings of the 15th international conference on application and theory of petri nets, lecture notes in computer science (Vol. 815) (1994), Springer, Berlin 416-435
31. Philipps J., and Scholz P. Formal verification of statecharts with instantaneous chain reactions. Tools and algorithms for the construction and analysis of systems, lecture notes in computer science (Vol. 1217) (1997), Springer, Berlin 224-238
32. Shannon C.E., and Weaver W. The mathematical theory of communication (1964), The University of Illinois Press, Urbana
33. Tani, S., Hamaguchi, K., & Yajima, S. (1993). The complexity of the optimal variable ordering problems of shared binary decision diagrams. In Fourth international symposium on algorithms and computation.
34. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955) 285-309
35. Vahidi, A. (2004). Efficient analysis of discrete systems. supervisor synthesis with binary decision diagrams. Ph.D. thesis (p. 487), Department of Signals and Systems, Chalmers University of Technology.
36. Vahidi, A., & Lennartson, B. (2001). Generic resource booking models in flexible cells. In Proceedings of IEEE international symposium on intelligent control ISIC.
37. Vahidi, A., Lennartson, B., Arkeryd, D., & Fabian, M. (2001). Efficient application of symbolic tools for resource booking problems. In Prooceedings of American control conference ACC.
38. Vahidi, A., Fabian, M., & Lennartson, B. (2004). Early termination by local string in incremental language containment tests. In Proceedings of the international workshop on discrete event systems (WODES' 04).
39. Wonham, W. M. (2002). Notes on control of discrete-event systems. University of Toronto.