An Automatic Technique for Checking the Simulation of Timed Systems

In this paper, we suggest an automatic technique for checking the timed weak simulation between timed transition systems. The technique is an observation-based method in which two timed transition systems are composed with a timed observer. A μ-calculus property that captures the timed weak simulation is then verified on the result of the composition. An interesting feature of the suggested technique is that it only relies on an untimed μ-calculus model-checker without any specific algorithm needed to analyze the result of the composition. We also show that our simulation relation supports interesting results concerning the trace inclusion and the preservation of linear properties. Finally, the technique is validated using the FIACRE/TINA toolset.

[1]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[2]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[3]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[4]  Kim G. Larsen,et al.  Timed I/O automata: a complete specification theory for real-time systems , 2010, HSCC '10.

[5]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[6]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[7]  Mamoun Filali,et al.  Fiacre: an Intermediate Language for Model Verification in the Topcased Environment , 2008 .

[8]  Christine Paulin-Mohring,et al.  The coq proof assistant reference manual , 2000 .

[9]  E. Allen Emerson,et al.  Model Checking and the Mu-calculus , 1996, Descriptive Complexity and Finite Models.

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[12]  Kim G. Larsen,et al.  Methodologies for Specification of Real-Time Systems Using Timed I/O Automata , 2009, FMCO.

[13]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[14]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[15]  N. Lynch,et al.  Forward and backward simulations , 1993 .

[16]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[17]  Nancy A. Lynch,et al.  The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) , 2006 .

[18]  Colin Stirling,et al.  Modal Mu-Calculi , 2001 .

[19]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[20]  Kim G. Larsen,et al.  Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction , 2000, FTRTFT.

[21]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings , 1992 .

[22]  Steve A. Schneider,et al.  Concurrent and Real-time Systems: The CSP Approach , 1999 .

[23]  Kim G. Larsen,et al.  Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation , 2009, FORMATS.

[24]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, REX Workshop.

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

[26]  Alain Griffault,et al.  The Mec 5 Model-Checker , 2004, CAV.

[27]  F. Vaandrager,et al.  A Comparison of Additivity Axioms in Timed Transition Systems. , 1993 .

[28]  Kim G. Larsen,et al.  Automatic Abstraction Refinement for Timed Automata , 2007, FORMATS.

[29]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1996, Inf. Comput..

[30]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[31]  Colin Stirling,et al.  Modal mu-calculi , 2007, Handbook of Modal Logic.

[32]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[33]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

[34]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[35]  Joël Ouaknine,et al.  On the language inclusion problem for timed automata: closing a decidability gap , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[36]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.