VerICS 2006 - a Model Checker for Real-Time and Multi-Agent Systems?

The papers presents the current stage of the development of VerICS a model checker for real-time and multi-agent systems. Depending on the type of a system considered, it enables to test various classes of properties from reachability to temporal, epistemic and deontic formulas. The model checking methods used to this aim include both SAT-based and enumerative ones. In the paper we focus on new features of the verifier: SAT-based model checking for multi-agent systems and several extensions and improvements to real-time systems’ verification.

[1]  Wojciech Penczek,et al.  Verics: A Tool for Verifying Timed Automata and Estelle Specifications , 2003, TACAS.

[2]  Michael Wooldridge,et al.  Model checking multi-agent systems with MABLE , 2002, AAMAS '02.

[3]  Michael Wooldridge,et al.  Model Checking Multi-Agent Programs with CASP , 2003, CAV.

[4]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[5]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[6]  Wojciech Penczek,et al.  Bounded Model Checking for Deontic Interpreted Systems , 2005, LCMAS.

[7]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[8]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for Multi-agent Systems , 2006, TACAS.

[9]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[10]  Wojciech Penczek,et al.  Bounded model checking for knowledge and real time , 2005, AAMAS '05.

[11]  Wojciech Penczek,et al.  Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol , 2006, Fundam. Informaticae.

[12]  Alessio Lomuscio,et al.  Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation , 2007, MoChArt.

[13]  Wojciech Penczek,et al.  Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach , 2006, Studies in Computational Intelligence.

[14]  Andrzej Zbrzezny.  Improvements in SAT-based Reachability Analysis for Timed Automata , 2004, Fundam. Informaticae.

[15]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[16]  Wojciech Penczek,et al.  From Bounded to Unbounded Model Checking for Temporal Epistemic Logic , 2004, Fundam. Informaticae.

[17]  Andrzej Zbrzezny.  SAT-based Reachability Checking for Timed Automata with Diagonal Constraints , 2005, Fundam. Informaticae.

[18]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.