Bounded model checking for interpreted systems: Preliminary experimental results

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2699, Issue , 2003, Pages 115-125

  Lomuscio, A ^a   Lasica, T ^b   Penczek, W ^b,c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b Institute of Computer Science   (Poland)

^c SIEDLCE UNIVERSITY OF NATURAL SCIENCES AND HUMANITIES   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS; SYSTEMS ANALYSIS; ALGORITHMS;

INTERPRETED SYSTEMS; LOGICAL LANGUAGE; MODEL CHECKING; SYSTEMS SEMANTICS;

ALGORITHMS; MODEL CHECKING;

BOUNDED MODEL CHECKING; INTERPRETED SYSTEMS; INTERPRETED SYSTEMS SEMANTICS; LOGICAL LANGUAGE;

EID: 7044238426     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45133-4_10     Document Type: Conference Paper

References (16)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS'99, Volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.
2. E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19 (1):7-34, 2001.
3. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
4. E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2 (3):241-266, 1982.
5. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.
6. J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37 (3):549-587, 1990.
7. Apreliminary version appeared in Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984.
8. J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. In ACM Symposium on Theory of Computing (STOC '86), pages 304-315, Baltimore, USA, May 1986. ACM Press.
9. J. Halpern and M. Vardi. Model checking vs. theorem proving: a manifesto, pages 151-176. Artificial Intelligence and Mathematical Theory of Computation. Academic Press, Inc, 1991.
10. W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proc. of the 9th Int. SPIN Workshop (SPIN'02), Volume 2318 of LNCS, pages 95-111. Springer-Verlag, 2002.
11. W. van der Hoek and M. Wooldridge. Tractable multiagent planning for epistemic goals. In Proc. of the 1st Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS'02), July 2002. To appear.
12. R. van der Meyden and H. Shilov. Model checking knowledge and time in systems with perfect knowledge. In Proceedings of Proc. of FST&TCS, Volume 1738 of Lecture Notes in Computer Science, pages 432-445, Hyderabad, India, 1999.
13. W. Penczek and A. Lomuscio. Verifying epistemic properties of multiagent systems via model checking. In T. Sandholm, editor, Proceedings of AAMAS03, 2003. To appear.
14. W. Penczek and A. Lomuscio. Verifying epistemic properties of multiagent systems via bounded model checking. submitted to Fundamenta Informaticae, 2003.
15. W. Penczek, B. Wózna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51 (1-2):135-156, 2002.
16. L. Zhang. Zchaff. http://www.ee.princeton.edu/~chaff/zchaff.php, 2001.