Towards Bounded Model Checking for the Universal Fragment of TCTL

Bounded Model Checking (BMC) based on SAT methods consists in searching for a counterexample of a particular length and to generate a propositional formula that is satisfiable iff such a counterexample exists. Our paper shows how the concept of bounded model checking can be extended to deal with TACTL (the universal fragment of TCTL) properties of Timed Automata.

[1]  Johan Lilius,et al.  Efficient State Space Search for Time Petri Nets , 1998, MFCS Workshop on Concurrency.

[2]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.

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

[4]  Doron A. Peled.  Partial order reduction: Linear and branching temporal logics and process algebras , 1996, Partial Order Methods in Verification.

[5]  Stavros Tripakis,et al.  On-the-fly symbolic model checking for real-time systems , 1997, Proceedings Real-Time Systems Symposium.

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  Tomohiro Yoneda,et al.  Efficient Verification of Parallel Real–Time Systems , 1993, Formal Methods Syst. Des..

[8]  Amir Pnueli,et al.  Data-Structures for the Verification of Timed Automata , 1997, HART.

[9]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[10]  Richard H. Eckhouse,et al.  Minicomputer Systems: Organization, Programming, and Applications (Pdp-11) , 1975 .

[11]  Insup Lee,et al.  An efficient state space generation for analysis of real-time systems , 1996, ISSTA '96.

[12]  Wojciech Penczek,et al.  Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets , 2001, ICATPN.

[13]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

[14]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[15]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2001, Theory and Practice of Logic Programming.

[16]  Wang Yi,et al.  Partial Order Reductions for Timed Systems , 1998, CONCUR.

[17]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

[18]  Florence Pagani,et al.  Partial Orders and Verification of Real-Time systems , 1996, FTRTFT.

[19]  Nicolas Halbwachs,et al.  An implementation of three algorithms for timing verification based on automata emptiness , 1992, [1992] Proceedings Real-Time Systems Symposium.

[20]  Wojciech Penczek,et al.  Branching Time Bounded Model Checking for Elementary Net Systems , 2001 .

[21]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[22]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[23]  Ruurd Kuiper,et al.  Partial-order Reduction Techniques for Real-time Model Checking , 1998, Formal Aspects of Computing.

[24]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[25]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[26]  Rajeev Alur,et al.  Minimization of Timed Transition Systems , 1992, CONCUR.

[27]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[28]  Pierre Wolper,et al.  Partial-Order Methods for Temporal Verification , 1993, CONCUR.

[29]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[30]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[31]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[32]  Thomas A. Henzinger,et al.  A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking , 1996, CONCUR.

[33]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[34]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[35]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[36]  Wojciech Penczek,et al.  Improving Partial Order Reductions for Universal Branching Time Properties , 2000, Fundam. Informaticae.

[37]  Orna Grumberg,et al.  Model checking and modular verification , 1991, TOPL.

[38]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[39]  Stavros Tripakis,et al.  Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..