Model Checking Temporal Metric Specifications with Trio2Promela

  • Domenico Bianculli
  • Paola Spoletini
  • Angelo Morzenti
  • Matteo Pradella
  • Pierluigi San Pietro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4767)


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.


temporal logic model checking Spin 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ghezzi, C., Mandrioli, D., Morzenti, A.: TRIO, a logic language for executable specifications of real-time systems. The Journal of Systems and Software 12, 107–123 (1990)CrossRefGoogle Scholar
  2. 2.
    Morzenti, A., San Pietro, P.: Object-oriented logical specification of time-critical systems. ACM Trans. Softw. Eng. Methodol. 3, 56–98 (1994)CrossRefGoogle Scholar
  3. 3.
    Morzenti, A., Mandrioli, D., Ghezzi, C.: A model parametric real-time logic. ACM Trans. Program. Lang. Syst. 14, 521–573 (1992)CrossRefGoogle Scholar
  4. 4.
    Felder, M., Morzenti, A.: Validating real-time systems by history-checking TRIO specifications. ACM Trans. Softw. Eng. Methodol. 3, 308–339 (1994)CrossRefGoogle Scholar
  5. 5.
    Gargantini, A., Morzenti, A.: Automated deductive requirements analysis of critical systems. ACM Trans. Softw. Eng. Methodol. 10, 255–307 (2001)CrossRefGoogle Scholar
  6. 6.
    Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23, 279–295 (1997)CrossRefGoogle Scholar
  7. 7.
    Pradella, M., San Pietro, P., Spoletini, P., Morzenti, A.: Practical model checking of LTL with past. In: ATVA 2003 (2003)Google Scholar
  8. 8.
    Morzenti, A., Pradella, M., San Pietro, P., Spoletini, P.: Model checking TRIO specifications in Spin. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 542–561. Springer, Heidelberg (2003)Google Scholar
  9. 9.
    Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)Google Scholar
  10. 10.
    Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248–263. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)Google Scholar
  12. 12.
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28, 114–133 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Fritz, C.: Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 35–48. Springer, Heidelberg (2003)Google Scholar
  14. 14.
    Heitmeyer, C., Mandrioli, D. (eds.): Formal Methods for Real-Time Computing. Trends in Software, vol. 5. Wiley, Chichester (1996)Google Scholar
  15. 15.
    Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. Comput. Syst. 5, 1–11 (1987)CrossRefGoogle Scholar
  16. 16.
    Gastin, P., Oddoux, D.: LTL with past and two-way very-weak alternating automata. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 439–448. Springer, Heidelberg (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Domenico Bianculli
    • 1
  • Paola Spoletini
    • 2
  • Angelo Morzenti
    • 2
  • Matteo Pradella
    • 3
  • Pierluigi San Pietro
    • 2
  1. 1.Faculty of Informatics, University of LuganoSwitzerland
  2. 2.Dipartimento di Elettronica e Informazione, Politecnico di MilanoItaly
  3. 3.CNR IEIIT-MIItaly

Personalised recommendations