Model checking temporal metric specifications with Trio2Promela

We present Trio2Promela, a tool for model checking TRIO specifications by means of Spin. TRIO is a linear-time temporal logic with both future and past operators and a quantitative metric on time. Our approach is based on the translation of TRIO formulae into Promela programs guided by equivalence between TRIO and alternating Büchi automata. Trio2Promela may be used to check both purely descriptive TRIO specifications, a distinguishing difference with other model checking tools, and usual Promela programs for which the user needs to verify complex temporal properties. Then, we report on extensive and encouraging experimentation results, and compare Trio2Promela with similar tools.

[1]  Matteo Pradella,et al.  Model-Checking TRIO Specifications in SPIN , 2003, FME.

[2]  Carsten Fritz,et al.  Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata , 2003, CIAA.

[3]  Angelo Gargantini,et al.  Automated deductive requirements analysis of critical systems , 2001, TSEM.

[4]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[5]  Dino Mandrioli,et al.  Formal Methods for Real-Time Computing , 1996 .

[6]  Stefania Gnesi,et al.  FME 2003: Formal Methods: International Symposium of Formal Methods Europe, Pisa, Italy, September 8-14, 2003. Proceedings , 2003, Lecture Notes in Computer Science.

[7]  Angelo Morzenti,et al.  Object-oriented logical specification of time-critical systems , 1994, TSEM.

[8]  Carlo Ghezzi,et al.  TRIO: A logic language for executable specifications of real-time systems , 1990, J. Syst. Softw..

[9]  Paul Gastin,et al.  LTL with Past and Two-Way Very-Weak Alternating Automata , 2003, MFCS.

[10]  Roberto Grossi,et al.  Mathematical Foundations Of Computer Science 2003 , 2003 .

[11]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[12]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[13]  Faron Moller,et al.  Logics for Concurrency , 1996, Lecture Notes in Computer Science.

[14]  Matteo Pradella,et al.  Practical Model Checking of LTL with Past , 2003 .

[15]  Miguel Felder,et al.  Validating Real-time Systems By History-checking TRIO Specifications , 1992, International Conference on Software Engineering.

[16]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[17]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[18]  Carlo Ghezzi,et al.  A model parametric real-time logic , 1992, TOPL.

[19]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.