A Symbolic Model Checker for ACTL

We present SAM, a symbolic model checker for ACTL, the action-based version of CTL. SAM relies on implicit representations of Labeled Transition Systems (LTSs), the semantic domain for ACTL formulae, and uses symbolic manipulation algorithms. SAM has been realized by translating (networks of) LTSs and, possibly recursive, ACTL formulae into BSP (Boolean Symbolic Programming), a programming language aiming at defining computations on boolean functions, and by using the BSP interpreter to carry out computations (i.e. verifications).

[1]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[2]  Stefania Gnesi,et al.  JACK: Just Another Concurrency Kit. The intergration Projekt , 1994, Bull. EATCS.

[3]  Enrico Tronci,et al.  Automatic Verification of a Hydroelectric Power Plant , 1996, FME.

[4]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..

[5]  Rocco De Nicola,et al.  Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.

[6]  Enrico Tronci.  On computing optimal controllers for finite state systems , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

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

[10]  Enrico Tronci.  Hardware verification, Boolean logic programming, Boolean functional programming , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[11]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[12]  E. Clarke,et al.  Symbolic Model Checking : IO * ’ States and Beyond * , 1992 .

[13]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[14]  Rocco De Nicola,et al.  An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems , 1991, CAV.

[15]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[16]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[17]  Rocco De Nicola,et al.  Verifying hardware components within JACK , 1995, CHARME.

[18]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[19]  Rance Cleaveland,et al.  The NCSU Concurrency Workbench , 1996, CAV.

[20]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[21]  Stefania Gnesi,et al.  A Formal Verification Environment for Railway Signaling System Design , 1998, Formal Methods Syst. Des..

[22]  Rocco De Nicola,et al.  An Action-Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems , 1993, Comput. Networks ISDN Syst..

[23]  Enrico Tronci,et al.  Automatic Veriication of a Hydroelectric Power Plant 1 , 1996 .

[24]  Stefania Gnesi,et al.  The Integration Project for the JACK Environement , 1994 .

[25]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[26]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[27]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.