Using Maximality-Based Labeled Transition System Model for Concurrency Logic Verification

In this paper, we show the interest of the maximality-based semantics for the check of concurrent system properties. For this purpose, we use the Maximality-based Labeled Transition System (MLTS) as a behavior model. From this point of view, we can omit action temporal and structural atomicity hypotheses; consequently, we can inherit result of combinatorial state space explosion problem solution based on the use of true concurrency semantics. Properties to be verified are expressed using the Computation Tree Logic (CTL). The main contribution of the paper is to show that model checking algorithms proposed in the literature, which are based on interleaving semantics, may be adapted easily to true concurrency semantics for the verification of new properties classes related to simultaneous progress of actions at different states.

[1]  François Vernadat,et al.  On Combining the Persistent Sets Method with the Covering Steps Graph Method , 2002, FORTE.

[2]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[3]  Rom Langerak,et al.  Bundle event structures: a non-interleaving semantics for LOTOS , 1992, FORTE.

[4]  John A. McDermid,et al.  Formal Methods: Use and Relevance for the Development of Safety-Critical Systems , 1992, Comput. J..

[5]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

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

[7]  Ouassila Labbani,et al.  Maximality-based symbolic model checking , 2003 .

[8]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[9]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[10]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[11]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[12]  Djamel-Eddine Saïdouni,et al.  Relating maximality-based semantics to action refinement in process algebras , 1994, FORTE.

[13]  François Vernadat,et al.  State Class Constructions for Branching Analysis of Time Petri Nets , 2003, TACAS.

[14]  Jean-Pierre Courtiat,et al.  A true concurrency semantics for LOTOS , 1992, FORTE.

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

[16]  Djamel Saidouni.  Semantique de maximalite : application au raffinement d'actions dans lotos , 1996 .

[17]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.