Supervisory control using satisfiability solvers

Proceedings - 9th International Workshop on Discrete Event Systems, WODES' 08

Volumn , Issue , 2008, Pages 81-86

  Voronov, Alexey ^a   Åkesson, Knut ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; CONTROL THEORY; CYBERNETICS; INDUSTRIAL APPLICATIONS; MODEL CHECKING; NUCLEAR PROPULSION; SCADA SYSTEMS; SUPERVISORY PERSONNEL; SYSTEM THEORY; TECHNICAL PRESENTATIONS;

BOOLEAN SATISFIABILITY PROBLEMS; CONTROL FUNCTIONS; DISCRETE EVENT SYSTEMS; DISCRETE EVENTS; HARDWARE CIRCUITS; INDUSTRIAL SIZE; INDUSTRIAL USES; NP-COMPLETE; SATISFIABILITY PROBLEMS; SATISFIABILITY SOLVERS; SUPERVISORY CONTROL; SUPERVISORY CONTROL THEORY; SYNTHESIS OF;

PROBLEM SOLVING;

EID: 53149086257     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2008.4605926     Document Type: Conference Paper

References (32)

1. P. J. G. Ramadge and W. M. Wonham, "The control of discrete event systems," Proceedings of the IEEE, vol, 77, no, 1, pp. 81-98, 1989.
2. C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Kluwer Academic Publishers, September 1999.
3. P. Gohari and W. M. Wonham, "On the complexity of supervisory control design in the RW framework," Systems, Man, and Cybernetics, Part B, IEEE Transactions on, vol. 30, no. 5, pp. 643-652, 2000.
4. S. A. Cook, "The complexity of theorem-proving procedures," in STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, (New York, NY, USA), pp. 151-158, ACM Press, 1971.
5. A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zhu, "Bounded model checking," Advances in Computers, vol. 58, pp. 118-149, 2003.
6. M. R. Prasad, A. Biere, and A. Gupta, "A survey of recent advances in sat-based formal verification," International Journal on Software Tools for Technology Transfer (STTT), vol. 7, pp. 156-173, April 2005.
7. S. L. Chung, S. Lafortune, and F. Lin, "Limited lookahead policies in supervisory control of discrete event systems," Automatic Control, IEEE Transactions on, vol. 37, no. 12, pp. 1921-1935, 1992.
8. N. B. Hadj-Alouane, S. Lafortune, and F. Lin, "Variable lookahead supervisory control with state information," Automatic Control, IEEE Transactions on, vol. 39, no. 12, pp. 2398-2410, 1994.
9. H. Kautz and B. Selman, "Planning as satisfiability," in ECAI '92: Proceedings of the 10th European conference on Artificial intelligence, (New York, NY, USA), pp. 359-363, John Wiley & Sons, Inc., 1992.
10. H. Kautz and B. Selman, "Pushing the envelope: Planning, prepositional logic, and stochastic search," in Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference (H. Shrobe and T Senator, eds.), (Menlo Park, California), pp. 1194-1201, AAAI Press, 1996.
11. A. Grastien, Anbulagan, J. Rintanen, and E. Kelareva, "Diagnosis of discrete-event systems using satisfiability algorithms," in Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pp. 305-310, AAAI Press, 2007.
12. J. Rintanen and A. Grastien, "Diagnosability testing with satisfiability algorithms," in Proceedings of the 20th International Joint Conference on Artificial Intelligence (M. Veloso, ed.), pp. 532-537, AAAI Press, 2007.
13. K. Åkesson, H. Flordal, and M. Fabian, "Exploiting modularity for synthesis and verification of supervisors," in Proceedings of the IFAC World Congress on Automatic Control, 2002.
14. H. Flordal, R. Malik, M. Fabian, and K. Åkesson, "Compositional synthesis of maximally permissive supervisors using supervision equivalence," Discrete Event Dynamic Systems, vol. 17, no. 4, pp. 475-504, 2007.
15. G. Hoffmann and H. Wong-Toi, "Symbolic synthesis of supervisory controllers," in Proc. of 1992 American Control Conference, (Chicago, IL, USA), pp. 2789-2793, 1992.
16. A. Vahidi, Efficient Analysis of Discrete Event Systems: Supervisor Synthesis with Binary Decision Diagrams. PhD thesis, Chalmers University of Technology, 2004.
17. M. Byröd, B. Lennartson, A. Vahidi, and K. Åkesson, "Efficient reachability analysis on modular discrete-event systems using binary decision diagrams," in Discrete Event Systems, 2006 8th International Workshop on, pp. 288-293, 2006.
18. 20 states and beyond," in Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on the, pp. 428-439, 1990.
19. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, "Planning in nondeterministic domains under partial observability via symbolic model checking," in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligencee (B. Nebel, ed.), (Seattle, Washington, USA), pp. 473-478, Morgan Kaufmann, August 2001.
20. A. Vahidi, M. Fabian, and B. Lennartson, "Efficient supervisory synthesis of large systems," Control Engineering Practice, vol. 14, pp. 1157-1167, October 2006.
21. T. Boy de la Tour, "Minimizing the number of clauses by renaming," in CADE-10: Proceedings of the tenth international conference on Automated deduction, (New York, NY, USA), pp. 558-572, Springer-Verlag New York, Inc., 1990.
22. A. Nonnengart and C. Weidenbach, "Computing small clause normal forms," in Handbook of Automated Reasoning (A. Robinson and A. Voronkov, eds.), vol. I, pp. 335-367, Elsevier Science, 2001.
23. E. Clarke, A. Biere, R. Raimi, and Y. Zhu, "Bounded model checking using satisfiability solving," Form. Methods Syst. Des., vol. 19, pp. 7-34, July 2001.
24. K. Åkesson, M. Fabian, H. Flordal, and R. Malik, "Supremica - an integrated environment for verification, synthesis and simulation of discrete event systems," in Proceedings of 2006 Workshop of Discrete Event Systems (WODES'06), (Ann Arbor, Michigan), pp. 384-385, 2006.
25. K. Åkesson, Methods and Tools in Supervisory Control Theory: Operator Aspects, Computational Efficiency, and Applications. PhD thesis, Chalmers University of Technology, 2002.
26. J. Marques-Silva and K. A. Sakallah, eds., Theory and Applications of Satisfiability Testing - SAT 2007, Springer, 2007.
27. N. Eén and N. Sörensson, An Extensible SAT-solver, vol. 2919/2004, ch. An Extensible SAT-solver, pp. 502-518. Springer Berlin / Heidelberg, 2004.
28. K. Pipatsrisawat and A. Darwiche, "Rsat 2.0: Sat solver description," Tech. Rep. D-153, Automated Reasoning Group, Computer Science Department, UCLA, 2007.
29. A. Biere, "Picosat versions 535." SAT Competition 2007 - solver description. Available online http://www.satcompetition.org/2007/picosat.pdf, April 2007.
30. M. Heule, M. Dufour, J. van Zwieten, and H. van Maaren, "March_eq: Implementing additional reasoning into an efficient look-ahead SAT solver," in Theory and Applications of Satisfiability Testing, vol. 3542/2005 of Lecture Notes in Computer Science, pp. 345-359, Springer Berlin / Heidelberg, 2005.
31. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient sat solver," in 39th Design Automation Conference (DAC 2001), (Las Vegas), June 2001.
32. A. Kobetski and M. Fabian, "Scheduling of discrete event systems using mixed integer linear programming," in Discrete Event Systems, 2006 8th International Workshop on, pp. 76-81, 2006.