论文信息 - FOCOVE: Formal Concurrency Verification Environment for Complex Systems

FOCOVE: Formal Concurrency Verification Environment for Complex Systems

This paper presents a tool to exploit a true concurrency model, namely the Maximality‐based Labeled Transitions Systems. We show the use of this model in model checking technique. Three techniques are implemented in order to solve the state space combinatorial explosion problem: the reduction modulo α‐equivalence relation, the joint use of covering steps and maximality semantics, and the maximality‐based symbolic representation.

Nabil Belala | Djamel-Eddine Saidouni | Adel Benamira | Farid Arfi

[1] Djamel-Eddine Saïdouni,et al. Using Maximality-Based Labeled Transition System Model for Concurrency Logic Verification , 2005, Int. Arab J. Inf. Technol..

[2] Joseph Sifakis,et al. Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[3] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.

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

[5] Riccardo Sisto,et al. A method to build symbolic representations of LOTOS specifications , 1995, PSTV.

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

[7] Patrice Godefroid. Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[8] François Vernadat,et al. Covering Step Graph , 1996, Application and Theory of Petri Nets.

[9] Nabil Belala,et al. Actions Duration in Timed Models , 2006 .