An Overview of the mCRL2 Toolset and Its Recent Advances

The analysis of complex distributed systems requires dedicated software tools. The mCRL language and toolset have been developed to support such analysis. We highlight changes and improvements made to the toolset in recent years. On the one hand, these affect the scope of application, which has been broadened with extended support for data structures like infinite sets and functions. On the other hand, considerable progress has been made regarding the performance of our tools for state space generation and model checking, due to improvements in symbolic reduction techniques and due to a shift towards parity game-based solving. We also discuss the software architecture of the toolset, which was well suited to accommodate the above changes, and we address a number of case studies to illustrate the approach.

[1]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[2]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[3]  Fpm Frank Stappers.  Bridging formal models : an engineering perspective , 2012 .

[4]  Michel A. Reniers,et al.  Transforming SOS Specifications to Linear Processes , 2011, FMICS.

[5]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6]  Sjoerd Cranen.  Model Checking the FlexRay Startup Phase , 2012, FMICS.

[7]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[8]  Jan Friso Groote,et al.  Linearization in parallel pCRL , 2000, J. Log. Algebraic Methods Program..

[9]  J.E. Rooda,et al.  Design of supervisory machine control , 2003, 2003 European Control Conference (ECC).

[10]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[11]  Jan Friso Groote,et al.  A linear translation from CTL* to the first-order modal μ -calculus , 2011, Theor. Comput. Sci..

[12]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[13]  Laurence Tratt,et al.  Eco: A Language Composition Editor , 2014, SLE.

[14]  Jaco van de Pol,et al.  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems , 2007, CONCUR.

[15]  Simona Orzan,et al.  Static Analysis Techniques for Parameterised Boolean Equation Systems , 2009, TACAS.

[16]  Girish Bhat,et al.  Efficient model checking via the equational /spl mu/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[17]  Kim G. Larsen,et al.  Memory Efficient Data Structures for Explicit Verification of Timed Systems , 2014, NASA Formal Methods.

[18]  Flemming Nielson,et al.  Automatic validation of protocol narration , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[19]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[20]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[21]  Jun Sun,et al.  PAT: Towards Flexible Verification under Fairness , 2009, CAV.

[22]  J. V. van Wijk,et al.  Visualization of state transition graphs , 2001, IEEE Symposium on Information Visualization, 2001. INFOVIS 2001..

[23]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[24]  Kees Verstoep,et al.  Using model checking to analyze the system behavior of the LHC production grid , 2013, Future Gener. Comput. Syst..

[25]  Paul Grefen,et al.  A Three-Level Process Framework for Contract-Based Dynamic Service Outsourcing , 2003 .

[26]  Jaco van de Pol.  JITty: A Rewriter with Strategy Annotations , 2002, RTA.

[27]  Ka Lok Man,et al.  Syntax and consistent equation semantics of hybrid Chi , 2006, J. Log. Algebraic Methods Program..

[28]  Jan Friso Groote,et al.  Dogfooding the Formal Semantics of mCRL2 , 2012, 2012 35th Annual IEEE Software Engineering Workshop.

[29]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[30]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[31]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[32]  Ekkart Kindler,et al.  The Petri Net Markup Language , 2003, Petri Net Technology for Communication-Based Systems.

[33]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

[34]  Tim A. C. Willemse,et al.  Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems , 2011, Inf. Comput..

[35]  Michel A. Reniers,et al.  Formalizing a Domain Specific Language Using SOS: An Industrial Case Study , 2011, SLE.

[36]  Jan Friso Groote,et al.  Parameterised boolean equation systems , 2005, Theor. Comput. Sci..

[37]  Jaco van de Pol,et al.  Modal Abstractions in µCRL , 2004, AMAST.

[38]  Radu Mateescu,et al.  CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes , 2011, TACAS.

[39]  Jeroen Keiren,et al.  Bisimulation Minimisations for Boolean Equation Systems , 2009, Haifa Verification Conference.

[40]  Meenakshi D'Souza,et al.  Theoretical Aspects of Computing – ICTAC 2012 , 2012, Lecture Notes in Computer Science.

[41]  Sjoerd Cranen,et al.  Stuttering Mostly Speeds Up Solving Parity Games , 2011, NASA Formal Methods.

[42]  Ian Stark,et al.  Randomised Testing of a Microprocessor Model Using SMT-Solver State Generation , 2014, FMICS.

[43]  Simona Orzan,et al.  Invariants for Parameterised Boolean Equation Systems , 2010, Theor. Comput. Sci..

[44]  Giacomo Lenzi,et al.  Relating levels of the mu-calculus hierarchy and levels of the monadic hierarchy , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[45]  Stephen J. Mellor,et al.  Executable UML - A Foundation for Model-Driven Architecture , 2002, Addison Wesley object technology series.

[46]  W. Zielonka.  In nite games on nitely coloured graphs with applications to automata on in nite trees , 1998 .

[47]  Jaco van de Pol,et al.  Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games , 2012, GRAPHITE.

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

[49]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[50]  Lubos Brim,et al.  DiVinE Multi-Core - A Parallel LTL Model-Checker , 2008, ATVA.

[51]  Jarke J. van Wijk,et al.  Bridging the Semantic Gap: Visualizing Transition Graphs with User-Defined Diagrams , 2007, IEEE Computer Graphics and Applications.

[52]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[53]  Jaco van de Pol,et al.  1 Motivation : A Modular , High-Performance Model Checker , 2010 .

[54]  Sjoerd Cranen,et al.  A Cure for Stuttering Parity Games , 2012, ICTAC.

[55]  Radu Mateescu,et al.  CADP 2011: a toolbox for the construction and analysis of distributed processes , 2012, International Journal on Software Tools for Technology Transfer.

[56]  Joseph Sifakis,et al.  Tools and Applications II: The IF Toolset , 2004 .

[57]  C. Gaspar,et al.  SMI++ object-oriented framework for designing and implementing distributed control systems , 2004, IEEE Transactions on Nuclear Science.

[58]  van Mj Muck Weerdenburg,et al.  Efficient rewriting techniques , 2009 .

[59]  N.J.M. van den Nieuwelaar,et al.  Supervisory machine control by predictive-reactive scheduling , 2004 .

[60]  Orna Grumberg,et al.  3-Valued Abstraction: More Precision at Less Cost , 2006, LICS.

[61]  Jan Friso Groote,et al.  Model-checking processes with data , 2005, Sci. Comput. Program..

[62]  Sjoerd Cranen,et al.  Abstraction in parameterised Boolean equation systems , 2013 .