Compositional Model Checking Is Lively

Compositional model checking approaches attempt to limit state space explosion by iteratively combining behaviour of some of the components in the system and reducing the result modulo an appropriate equivalence relation. For an equivalence relation to be applicable, it should be a congruence for parallel composition where synchronisations between the components may be introduced. An equivalence relation preserving both safety and liveness properties is divergence-preserving branching bisimulation (DPBB). It is generally assumed that DPBB is a congruence for parallel composition, even in the context of synchronisations between components. However, so far, no such results have been published.

[1]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[2]  Irek Ulidowski,et al.  Ordered SOS process languages for branching and Eager bisimulation , 2002 .

[3]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

[5]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[6]  Frédéric Lang,et al.  Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods , 2005, IFM.

[7]  Anton Wijs.  Confluence Detection for Transformations of Labelled Transition Systems , 2015, GaM.

[8]  Ivan Lanese,et al.  Towards a Unifying Theory for Web Services Composition , 2006, WS-FM.

[9]  Anton Wijs.  GPU Accelerated Strong and Branching Bisimilarity Checking , 2015, TACAS.

[10]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[11]  L. Spaninks.  An axiomatisation for rooted branching bisimulation with explicit divergence , 2013 .

[12]  Laurent Mounier,et al.  Compositional State Space Generation from Lotos Programs , 1997, TACAS.

[13]  Frédéric Lang,et al.  Refined Interfaces for Compositional Verification , 2006, FORTE.

[14]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

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

[16]  Henrik Reif Andersen,et al.  Partial model checking , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[17]  Anton Wijs,et al.  Define, Verify, Refine: Correct Composition and Transformation of Concurrent System Semantics , 2013, FACS.

[18]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[19]  Bas Luttik,et al.  Branching Bisimilarity with Explicit Divergence , 2009, Fundam. Informaticae.

[20]  Anton Wijs.  Achieving Discrete Relative Timing with Untimed Process Algebra , 2007, 12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007).

[21]  Anton Wijs,et al.  From χt to µCRL: Combining Performance and Functional Analysis , 2005, 10th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'05).

[22]  Bas Luttik,et al.  Computation Tree Logic with Deadlock Detection , 2009, Log. Methods Comput. Sci..

[23]  Henrik Reif Andersen,et al.  Partial model checking of modal equations: A survey , 1999, International Journal on Software Tools for Technology Transfer.

[24]  Florence Maraninchi,et al.  Operational and Compositional Semantics of Synchronous Automaton Compositions , 1992, CONCUR.

[25]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[26]  Doron A. Peled,et al.  Ten Years of Partial Order Reduction , 1998, CAV.

[27]  Cees T. A. M. de Laat,et al.  A Medium-Scale Distributed System for Computer Science Research: Infrastructure for the Long Term , 2016, Computer.

[28]  Jan Friso Groote,et al.  An O(m\log n) Algorithm for Stuttering Equivalence and Branching Bisimulation , 2016, TACAS.

[29]  Anton Wijs,et al.  Verifying a Verifier: On the Formal Correctness of an LTS Transformation Verification Technique , 2016, FASE.

[30]  Anton Wijs,et al.  Property-dependent reductions adequate with divergence-sensitive branching bisimilarity , 2014, Sci. Comput. Program..

[31]  Jan Friso Groote,et al.  An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation , 2017, ACM Trans. Comput. Log..

[32]  Anton Wijs,et al.  REFINER: Towards Formal Verification of Model Transformations , 2014, NASA Formal Methods.

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

[34]  Radu Mateescu,et al.  Compositional verification of asynchronous concurrent systems using CADP , 2015, Acta Informatica.

[35]  Erik P. de Vink,et al.  An Overview of the mCRL2 Toolset and Its Recent Advances , 2013, TACAS.

[36]  Frédéric Lang,et al.  Smart Reduction , 2011, FASE.

[37]  Anton Wijs,et al.  Efficient Property Preservation Checking of Model Refinements , 2013, TACAS.