Alessio Lomuscio
- MCK: Model checking knowledge. http://www.cse.unsw.edu.au/~mck.Google Scholar
- Verics. http://verics.ipipan.waw.pl.Google Scholar
- R. Alur, L. de Alfaro, T. Henzinger, S. Krishnan, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran. MOCHA user manual. Technical report, University of California at Berkeley, 2000. http://www-cad.eecs.berkeley.edu/~mocha/doc/c-doc/c-manual.ps.gz.Google Scholar
- R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183--235, 1994. Google ScholarDigital Library
- R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672--713, 2002. Google ScholarDigital Library
- T. Ball, A. Podelski, and S. K. Rajamani. Boolean and cartesian abstraction for model checking C programs. In TACAS, pages 268--283, 2001. Google ScholarDigital Library
- T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In Proc. of SPIN 2001, volume 2057 of LNCS, pages 103--122. Springer-Verlag, 2001. Google ScholarDigital Library
- A. Biere, A. Cimatti, E. Clarke, O. Strichman, and Y. Zhu. Bounded model checking. In Highly Dependable Software, volume 58 of Advances in Computers. Academic Press, 2003. Pre-print.Google Scholar
- A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of the 5th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of LNCS, pages 193--207. Springer-Verlag, 1999. Google ScholarDigital Library
- P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001. Google ScholarDigital Library
- R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computers, 35(8):677--691, 1986. Google ScholarDigital Library
- J. R. Burch, E. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 10<sup>20</sup> states and beyond. Information and Computation, 98(2):142--170, 1990. Google ScholarDigital Library
- P. Chauhan, E. Clarke, and D. Kroening. Using SAT-based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University, July 2003.Google Scholar
- D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65--75, 1988. Google ScholarCross Ref
- A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NUSMV: A new symbolic model verifier. In Proc. of the 11th International Conference on Computer Aided Verification (CAV'99), volume 1633 of LNCS, pages 495--499. Springer, 1999. Google ScholarDigital Library
- E. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. In Proc. of the 5th Int. Conf. on Computer Aided Verification (CAV'93), volume 697 of LNCS, pages 450--462. Springer-Verlag, 1993. Google ScholarDigital Library
- E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999. Google ScholarDigital Library
- D. Dams, R. Gerth, G. Dohmen, R. Herrmann, P. Kelb, and H. Pargmann. Model checking using adaptive state and data abstraction. In Proc. of the 6th Int. Conf. on Computer Aided Verification (CAV'94), volume 818 of LNCS, pages 455--467. Springer-Verlag, 1994. Google ScholarDigital Library
- P. Dembiński, A. Janowska, P. Janowski, W. Penczek, A. Pólrola, M. Szreter, B. Woźna, and A. Zbrzezny. VerICS: A tool for verifying timed automata and Estelle specifications. In Proc. of the 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), volume 2619 of LNCS, pages 278--283. Springer-Verlag, 2003.Google Scholar
- E. A. Emerson and C. S. Jutla. Symmetry and model checking. In Proc. of the 5th Int. Conf. on Computer Aided Verification (CAV'93), volume 697 of LNCS, pages 463--478. Springer-Verlag, 1993. Google ScholarDigital Library
- E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9:105--131, 1995. Google ScholarDigital Library
- R. Fagin, J. Y. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995. Google ScholarDigital Library
- P. Gammie and R. van der Meyden. MCK: Model checking the logic of knowledge. In Proc. of the 16th Int. Conf. on Computer Aided Verification (CAV'04), volume 3114 of LNCS, pages 479--483. Springer-Verlag, 2004.Google ScholarCross Ref
- M. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based unbounded symbolic model checking using circuit cofactoring. In Proc. of the Int. Conf. on Computer-Aided Design (ICCAD'04), pages 510--517, 2004. Google ScholarDigital Library
- R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. Information and Computation, 150:132--152, 1999. Google ScholarDigital Library
- J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549--587, 1990. A preliminary version appeared in Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Hintikka. Knowledge and Belief, An Introduction to the Logic of the Two Notions. Cornell University Press, Ithaca (NY) and London, 1962.Google Scholar
- 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. Google ScholarDigital Library
- G. J. Holzmann. The model checker SPIN. IEEE transaction on software engineering, 23(5):279--295, 1997. Google ScholarDigital Library
- M. R. A. Huth and M. D. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge, England, 2000. Google ScholarDigital Library
- W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 63(2--3):185--219, 2004. Google ScholarDigital Library
- M. Kacprzak, A. Lomuscio, A. Niewiadomski, W. Penczek, F. Raimondi, and M. Szreter. Comparing BDD and SAT based techniques for model checking Chaum's dining cryptographers protocol. Fundamenta Informaticae, 63(2, 3):221--240, 2006. Google ScholarDigital Library
- M. Kacprzak, A. Lomuscio, and W. Penczek. Unbounded model checking for knowledge and time. Technical Report 966, ICS PAS, Ordona 21, 01--237 Warsaw, December 2003.Google Scholar
- M. Kacprzak, A. Lomuscio, and W. Penczek. From bounded to unbounded model checking for temporal epistemic logic. Fundamenta Informaticae, 63(2--3):221--240, 2004. Google ScholarDigital Library
- I. Kang and I. Lee. An efficient state space generation for the analysis of real-time systems. In Proc. of Int. Symposium on Software Testing and Analysis, 1996. Google ScholarDigital Library
- W. Lenzen. Recent work in epistemic logic, volume 30 of Acta Philosophica Fennica. North-Holland, Amsterdam, 1978.Google Scholar
- A. Lomuscio, C. Pecheur, and F. Raimondi. Automatic verification of knowledge and time with NuSMV. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, pages 1384--1389, Hyderabad, India, January 2007. AAAI. Google ScholarDigital Library
- A. Lomuscio and F. Raimondi. The complexity of model checking concurrent programs against CTLK specifications. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'06), pages 548--550, Hakodake, Japan, 2006. ACM Press. Google ScholarDigital Library
- A. Lomuscio and F. Raimondi. MCMAS: A model checker for multi-agent systems. In H. Hermanns and J. Palsberg, editors, Proceedings of TACAS 2006, Vienna, volume 3920, pages 450--454. Springer Verlag, March 2006. Google ScholarDigital Library
- A. Lomuscio, F. Raimondi, and B. Wozna. Verification of the tesla protocol in MCMAS-X. Fundamenta Informaticae, 79(3--4):473--486, July 2007. Google ScholarDigital Library
- A. Lomuscio and M. Sergot. Deontic interpreted systems. Studia Logica, 75(1):63--92, 2003.Google ScholarCross Ref
- A. Lomuscio and B. Woźna. A complete and decidable security-specialised logic and its application to the tesla protocol. In Peter Stone and Gerhard Weiss, editors, Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'06), pages 145--152, Hakodake, Japan, 2006. ACM Press. Google ScholarDigital Library
- A. Lomuscio, B. Woźna, and W. Penczek. Bounded model checking for knowledge over real time. Artificial Intelligence, 2007. To appear. Google ScholarDigital Library
- K. McMillan. Symbolic model checking: An approach to the state explosion problem. Kluwer Academic Publishers, 1993. Google ScholarDigital Library
- K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proc. of the 14th Int. Conf. on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 250--264. Springer-Verlag, 2002. Google ScholarDigital Library
- R. van der Meyden and N. V. Shilov. Model checking knowledge and time in systems with perfect recall. In Proc. of the 19th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'99), volume 1738 of LNCS, pages 432--445. Springer-Verlag, 1999. Google ScholarDigital Library
- R. van der Meyden and K. Su. Symbolic model checking the knowledge of the dining cryptographers. In Proc. of the 17th IEEE Computer Security Foundations Workshop (CSFW-17), pages 280--291. IEEE Computer Society, June 2004. Google ScholarDigital Library
- W. Nabialek, A. Niewiadomski, W. Penczek, A. Pólrola, and M. Szreter. VerICS 2004: A model checker for real time and multi-agent systems. In Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P'04), volume 170(1) of Informatik-Berichte, pages 88--99. Humboldt University, 2004.Google Scholar
- R. Parikh and R. Ramanujam. Distributed processes and the logic of knowledge. In Logic of Programs, pages 256--268, 1985. Google ScholarDigital Library
- C. Pecheur and F. Raimondi. Symbolic model checking of logics with actions. In Proceedings of MoChArt 2006, Lecture Notes in Artificial Intelligence. Springer Verlag, August 2006. to appear.Google Scholar
- D. Peled. All from one, one for all: on model checking using representatives. In CAV, pages 409--423, 1993. Google ScholarDigital Library
- W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2):167--185, 2003. Google ScholarDigital Library
- W. Penczek and A. Pólrola. Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach, volume 20 of Studies in Computational Intelligence. Springer-Verlag, 2006. Google ScholarDigital Library
- W. Penczek, B. Woźna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51(1--2):135--156, 2002. Google ScholarDigital Library
- F. Raimondi. Model Checking Multi-Agent Systems. PhD thesis, University of London, 2006.Google Scholar
- F. Raimondi and A. Lomuscio. A tool for specification and verification of epistemic properties of interpreted systems. In W. van der Hoek, A. Lomuscio, E. de Vink, and M. Wooldridge, editors, Proc. of the Int. Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'03), volume 85(2) of ENTCS. Elsevier, 2003.Google Scholar
- F. Raimondi and A. Lomuscio. Symbolic model checking of deontic interpreted systems via OBDDs. In Proceedings of DEON04, Seventh International Workshop on Deontic Logic in Computer Science, volume 3065 of LNCS, pages 228--242. Springer Verlag, 2004.Google Scholar
- F. Raimondi and A. Lomuscio. http://www.cs.ucl.ac.uk/staff/f.raimondi/MCMAS, 2006.Google Scholar
- F. Raimondi and A. Lomuscio. Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied Logic, 5, 2007.Google Scholar
- S. J. Rosenschein. Formal theories of AI in knowledge and robotics. New generation computing, 3:345--357, 1985. Google ScholarDigital Library
- F. Somenzi. CUDD: CU decision diagram package -- release 2.4.0. http://vlsi.colorado.edu/~fabio/CUDD/cuddIntro.html, 2005.Google Scholar
- M. Szreter. Selective search in bounded model checking of reachability properties. In Proc. of the 3rd Int. Symp. on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of LNCS, pages 159--173. Springer-Verlag, 2005. Google ScholarDigital Library
- M. Szreter. Generalized blocking clauses in unbounded model checking. In Proc. of the 3rd Int. Workshop on Constraints in Formal Verification (CFV'05), 2006. To appear in ENTCS.Google Scholar
- W. van der Hoek and M. Wooldridge. Model checking cooperation, knowledge, and time - a case study. Research In Economics, 57(3):235--265, September 2003.Google ScholarCross Ref
- M. Wooldridge, T. Agotnes, P. E. Dunne, and W. van der Hoek. Logic for automated mechanism design - a progress report. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), 2007. Google ScholarDigital Library
- B. Woźna, A. Lomuscio, and W. Penczek. Bounded model checking for deontic interpreted systems. In Proc. of the 2nd Int. Workshop on Logic and Communication in Multi-Agent Systems (LCMAS'04), volume 126 of ENTCS, pages 93--114. Elsevier, 2005.Google Scholar
- L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proc. of Int. Conf. on Computer-Aided Design (ICCAD'01), pages 249--285, 2001. Google ScholarDigital Library
Index Terms
- Symbolic model checking for temporal-epistemic logics
Recommendations
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and ActionWe survey some of the recent work in verification via symbolic model checking of temporal-epistemic logic. Specifically, we discuss OBDD-based and SAT-based approaches for epistemic logic built on discrete and real-time branching time temporal logic. ...
Symbolic Model Checking of Logics with Actions
Model Checking and Artificial IntelligenceReasoning about agents and modalities such as knowledge and belief leads to models where different relations over states co-exist, or equivalently, where information (labels, actions) is associated to state transitions. This paper discusses how to ...
Multi-valued Modal Fixed Point Logics for Model Checking
ISMVL '09: Proceedings of the 2009 39th International Symposium on Multiple-Valued LogicIn this paper, I will show how multi-valued logics are used for model checking. Model checking is an automatic technique to analyze correctness of hardware and software systems. A model checker is based on a temporal logic or a modal fixed point logic. ...
Comments