An Action Computation Tree Logic With Unless Operator

This paper is about action computation tree logic (ACTL), a propositional branching-time temporal logic very suitable for specifying properties of concurrent systems described with processes. A new variant of ACTL is introduced, which is based on temporal operators until and unless, whereas all other temporal operators are derived from them. A fixed point characterisation usable for global model checking with the ability of witnesses and counterexamples generation is shown. The relationship of the new ACTL with CTL and the classical ACTL is discussed.

[1]  François Laroussinie,et al.  About the Expressive Power of CTL Combinators , 1995, Inf. Process. Lett..

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

[3]  Stefania Gnesi,et al.  Model checking for action-based logics , 1994, Formal Methods Syst. Des..

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

[5]  Cornelis A. Middelburg.  A Simple Language for Expressing Properties of Telecommunication Services and Features , 1994 .

[6]  Alan Martin,et al.  Adequate Sets of Temporal Connectives in CTL , 2002, EXPRESS.

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

[8]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[9]  Stefania Gnesi,et al.  An Experience in Formal Verification of Safety Properties of a Railway Signalling Control System , 1995, SAFECOMP.

[10]  Radu Mateescu,et al.  Formal Description and Analysis of a Bounded Retransmission Protocol , 1996 .

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

[12]  Enrico Tronci,et al.  A Symbolic Model Checker for ACTL , 1998, FM-Trends.

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

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

[15]  Edmund M. Clarke,et al.  Efficient generation of counterexamples and witnesses in symbolic model checking , 1995, DAC '95.

[16]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

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

[18]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[19]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

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

[21]  Radu Mateescu,et al.  An overview of CADP 2001 , 2001 .

[22]  Alexander Kick,et al.  Generation of Counterexamples and Witnesses for the |-Calculus , 1995 .