Article

Practical Automated Partial Verification of Multi-paradigm Real-Time Models

Authors:

Carlo A. Furia,

Matteo Pradella,

Matteo RossiAuthors Info & Claims

ICFEM '08: Proceedings of the 10th International Conference on Formal Methods and Software Engineering

Pages 298 - 317

https://doi.org/10.1007/978-3-540-88194-0_19

Published: 27 October 2008 Publication History

Abstract

This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based) formalisms. The technique relies on the reduction, under reasonable assumptions, of the continuous-time verification problem to its discrete-time counterpart. This reconciles in a viable and effective way the dense/discrete and operational/descriptive dichotomies that are often encountered in practice when it comes to specifying and analyzing complex critical systems. The article investigates the applicability of the technique through a significant example centered on a communication protocol. Concurrent runs of the protocol are formalized by parallel instances of a Timed Automaton, while the synchronization rules between these instances are specified through Metric Temporal Logic formulas, thus creating a multi-paradigm model. Verification tests run on this model using a bounded satisfiability checker implementing the technique show consistent results and interesting performances.

References

[1]

Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183- 235 (1994).

[2]

Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM 43(1), 116-146 (1996).

[3]

Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 74- 106. Springer, Heidelberg (1992).

[4]

Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Information and Computation 104(1), 35-77 (1993).

[5]

De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: from timed models to timed implementations. Formal Aspects of Computing 17(3), 319-341 (2005).

[6]

Fainekos, G.E., Pappas, G.J.: Robust sampling for MITL specifications. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, Springer, Heidelberg (2007).

[7]

Furia, C.A.: Scaling up the formal analysis of real-time systems. PhD thesis, DEI, Politecnico di Milano (May 2007).

[8]

Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling time in computing. Technical Report 2007.22, DEI, Politecnico di Milano (January 2007).

[9]

Furia, C.A., Pradella, M., Rossi, M.: Automated verification of dense-time MTL specifications via discrete-time approximation. In: Cuellar, J., Maibaum, T.S.E. (eds.) FM 2008. LNCS, vol. 5014, pp. 132-147. Springer, Heidelberg (2008).

[10]

Furia, C.A., Pradella, M., Rossi, M.: Practical automated partial verification of multiparadigm real-time models (April 2008), http://arxiv.org/abs/0804.4383

[11]

Furia, C.A., Rossi, M.: Integrating discrete- and continuous-time metric temporal logics through sampling. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 215-229. Springer, Heidelberg (2006).

[12]

Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545-558. Springer, Heidelberg (1992).

[13]

Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 580-591. Springer, Heidelberg (1998).

[14]

Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255-299 (1990).

[15]

Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2) (1997).

[16]

Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 274-289. Springer, Heidelberg (2006).

[17]

Pradella, M.: Zot (March 2007), http://home.dei.polimi.it/pradella

[18]

Pradella, M., Morzenti, A., San Pietro, P.: The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties. In: Proc. of ESEC/FSE 2007 (2007).

Cited By

Pradella MMorzenti APietro P(2013)Bounded satisfiability checking of metric temporal logic specificationsACM Transactions on Software Engineering and Methodology10.1145/2491509.249151422:3(1-54)Online publication date: 30-Jul-2013
https://dl.acm.org/doi/10.1145/2491509.2491514
Furia CRossi M(2010)A theory of sampling for continuous-time metric temporal logicACM Transactions on Computational Logic10.1145/1838552.183856012:1(1-40)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838560

Recommendations

Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
SEFM '09: Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods

A core problem in formal methods is the transition from informal requirements to formal specifications. Especially when specifying reactive systems, many formalisms require the user to either understand a complex mathematical theory and notation or to ...
Bounded Model Checking of Incomplete Real-time Systems Using Quantified SMT Formulas
MTV '11: Proceedings of the 2011 12th International Workshop on Microprocessor Test and Verification

Verification of real-time systems - e.g. communication protocols or embedded controllers - is an important task. One method to detect errors is bounded model checking (BMC) where the system is iteratively unfolded and transformed into a satisfiability ...
Context-free timed formalisms: Robust automata and linear temporal logics
Abstract
The paper focuses on automata and linear temporal logics for real-time pushdown reactive systems bridging tractable formalisms specialized for expressing separately dense-time real-time properties and context-free properties though ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICFEM '08: Proceedings of the 10th International Conference on Formal Methods and Software Engineering

October 2008

396 pages

ISBN:9783540881933

Editors:
Shaoying Liu
Faculty of Computer and Information Sciences, Hosei University, Tokoy, Japan 184-8584
,
Tom Maibaum
Department of Computing and Software, McMaster University, Hamilton, Canada L8S 4K1
,
Keijiro Araki
Department of Computer Science and Communication Engineering, , Graduate School of Information Science and Electrical Engineering, Kyushu University, Higashi-ku, Japan 812-8581

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 27 October 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Pradella MMorzenti APietro P(2013)Bounded satisfiability checking of metric temporal logic specificationsACM Transactions on Software Engineering and Methodology10.1145/2491509.249151422:3(1-54)Online publication date: 30-Jul-2013
https://dl.acm.org/doi/10.1145/2491509.2491514
Furia CRossi M(2010)A theory of sampling for continuous-time metric temporal logicACM Transactions on Computational Logic10.1145/1838552.183856012:1(1-40)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838560

View Options

View options

Figures

Tables

Media

View Table of Conten