Counterexample-guided control

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 886-902

  Henzinger, Thomas A ^a   Jhala, Ranjit ^a   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; MODEL CHECKING; SPECIFICATIONS;

ALGORITHMIC VERIFICATION; CONTROL OBJECTIVES; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; INFINITE STATE SYSTEMS; MODULAR VERIFICATION; REFINEMENT ALGORITHMS; STATE EXPLOSION PROBLEMS; SUPERVISORY CONTROL;

CONTROLLERS;

EID: 35248865212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_69     Document Type: Article

References (22)

1. K. Altisen, G. Gössler, A. Pnueli, J. Sifakis, S. Tripakis, and S. Yovine. A framework for scheduler synthesis. In RTSS: Real-Time Systems Symposium, pages 154-163. IEEE, 1999.
2. R. Alur, L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. Automating modular verification. In CONCUR: Concurrency Theory, LNCS 1664, pages 82-97. Springer, 1999.
3. R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In CONCUR: Concurrency Theory, pages 74-88. LNCS 1243, Springer, 2001.
4. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672-713, 2002.
5. R. Alur, A. Itai, R.P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118:142-157, 1995.
6. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL: Principles of Programming Languages, pages 1-3. ACM, 2002.
7. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the AMS, 138:295-311, 1969.
8. A. Church. Logic, arithmetic, and automata. In International Congress of Mathematicians, pages 23-35. Institut Mittag-Leffler, 1962.
9. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV: Computer-Aided Verification, LNCS 1855, pages 154-169. Springer, 2000.
10. E.M. Clarke, S. Jha, Y. Lu, and H. Veith. Tree-like counterexamples in model checking. In LICS: Logic in Computer Science, pages 19-29. IEEE, 2002.
11. E.M. Clarke, O. Grumberg, K. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In DAC: Design Automation Conference, pages 427-432. ACM/IEEE, 1995.
12. L. de Alfaro and T.A. Henzinger. Interface automata. In FSE: Foundations of Software Engineering, pages 109-120. ACM, 2001.
13. L. de Alfaro, T.A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In CONCUR: Concurrency Theory, pages 536-550. LNCS 2154, Springer, 2001.
14. L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. Detecting errors before reaching them. In CAV: Computer-Aided Verification, LNCS 1855, pages 186-201. Springer, 2000.
15. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
16. E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking fragments of μ-calculus. In CAV: Computer-Aided Verification, LNCS 697, pages 385-396. Springer, 1993.
17. Y. Gurevich and L. Harrington. Trees, automata, and games. In STOC: Symposium on Theory of Computing, pages 60-65. ACM, 1982.
18. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL: Principles of Programming Languages, pages 58-70. ACM, 2002.
19. T.A. Henzinger, R. Majumdar, F.Y.C. Mang, and J.-F. Raskin. Abstract interpretation of game properties. In SAS: Static-Analysis Symposium, pages 220-239. LNCS 1824, Springer, 2000.
20. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In STAGS: Theoretical Aspects of Computer Science, LNCS 900, pages 229-242. Springer, 1995.
21. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL: Principles of Programming Languages, pages 179-190. ACM, 1989.
22. P. J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25:206-230, 1987.