Compositional Model-Checking Verification of Critical Systems

Ensuring the correctness of Critical Systems (CS) becomes more complex if we consider that their behaviour is the result of the concurrent execution of many components. Furthermore, any automaton–based representation of concurrent components yields an explosion in the number of states, thus limiting the use of Model–Checking (MC) verification techniques in practice. This article presents a compositional verification approach, which is formally supported by state–of–the–art MC tools. To facilitate and guarantee the verification of large CS, the proposed approach integrates MEDISTAM–RT (Spanish acronym of Method for System Design based on Analytic Transformation of Real–Time Models), CCTL temporal logic as the property specification formal language, and the formal language CSP+T, used to formally describe a model of the system to be verified. To show a practical use of the proposed approach, a critical part of a realistic industry project related to mobile phone communications is discussed.

[1]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[2]  Thomas Kropf,et al.  Modleing and Checking Networks of Communicating Real-Time Process , 1999, CHARME.

[3]  Sérgio Vale Aguiar Campos,et al.  Compositional Reasoning in Model Checking , 1997, COMPOS.

[4]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[5]  John Zic.  Time-constrained buffer specifications in CSP + T and timed CSP , 1994, TOPL.

[6]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[7]  David Garlan,et al.  A formal basis for architectural connection , 1997, TSEM.

[8]  Manuel I. Capel,et al.  A methodological approach to the formal specification of real-time systems by transformation of UML-RT design models , 2007, Sci. Comput. Program..

[9]  Richard Gerber,et al.  Compositional verification by model checking for counter-examples , 1996, ISSTA '96.

[10]  Michal Young,et al.  Compositional reachability analysis using process algebra , 1991, TAV4.

[11]  Holger Giese,et al.  Towards the compositional verification of real-time UML designs , 2003, ESEC/FSE-11.

[12]  Bengt Jonsson,et al.  Compositional specification and verification of distributed systems , 1994, TOPL.

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

[14]  Bran Selic,et al.  Using UML for Modeling Complex Real-Time Systems , 1998, LCTES.

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

[16]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[17]  George J. Milne,et al.  Correct Hardware Design and Verification Methods , 2003, Lecture Notes in Computer Science.

[18]  Manuel I. Capel,et al.  A Conceptual Scheme for Compositional Model-Checking Verification of Critical Communicating Systems , 2008, ICEIS.

[19]  Amir Pnueli,et al.  Compositionality: The Significant Difference , 1999, Lecture Notes in Computer Science.

[20]  Amir Pnueli,et al.  A Perfect Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software , 1999, World Congress on Formal Methods.

[21]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[22]  Shing-Chi Cheung,et al.  Enhancing compositional reachability analysis with context constraints , 1993, SIGSOFT '93.

[23]  Olaf Stursberg,et al.  MODULAR ANALYSIS OF DISCRETE CONTROLLERS FOR DISTRIBUTED HYBRID SYSTEMS , 2002 .

[24]  Ben Lukoschus,et al.  Compositional verification of industrial control systems : methods and case studies , 2006 .