Abstract
In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time property language with clocks. This property language may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every formula ϕ, a test automaton Tϕ in such a way that checking whether a system S satisfies the property ϕ can be reduced to a reachability question over the system obtained by making Tϕ interact with S.
Partially supported by the Human Capital and Mobility project EXPRESS.
Partially supported by Research Grant of the Spanish Ministry of Education and Culture and by BRICS. This work was carried out while the author was visiting Aalborg University.
Basic Research in Computer Science.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Aceto, P. Bouyer, A. Burgueno, and K. G. Larsen. The limitations of testing for timed automata, 1997. Forthcoming paper.
L. Aceto, A. Burgueno, and K. G. Larsen. Model checking via reachability testing for timed automata. Research Report RS-97-29, BRICS, Aalborg University, November 1997.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181–204, 1994. Preliminary version appears in Proc. 30th FOCS, 1989.
J. Bengtsson, D. Griffioen, K. Kristoifersen, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Verification of an audio protocol with bus collision using Uppaal. In R. Alur and T. A. Henzinger, editors, Proc. of the 8th. International Conference on Computer-Aided Verification, CAV'96, volume 1102 of Lecture Notes in Computer Science, New Brunswick, New Jersey, USA, July 31–August 3 1996. Springer-Verlag.
J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Uppaal — a tool suite for automatic verification of real-time systems. In Proc. of the 4th DIMACS Workshop on Verification and Control of Hybrid Systems, New Brunswick, New Jersey, 22–24 October 1995.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computer Machinery, 32(1):137–161, January 1985.
T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: the next generation. In Proc. of the 16th Real-time Systems Symposium, RTSS'95. IEEE Computer Society press, 1995.
T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proc. of the 27th Annual ACM Symposium on Theory of Computing, STOC'95, pages 373–382, 1995. Also appeared as Cornell University technical report TR95-1541.
T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.
P.-H. Ho and H. Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, editor, Proc. of the 7th. International Conference on Computer-Aided Verification, CAV'95, volume 939 of Lecture Notes in Computer Science, pages 381–394, Lige, Belgium, July 1995. Springer-Verlag.
H. E. Jensen, K. G. Larsen, and A. Skou. Modelling and analysis of a collision avoidance protocol using SPIN and Uppaal. In DIMACS Workshop SPIN '96, 2nd International SPIN Verification Workshop on Algorithms, Applications, Tool Use, Theory. Rutgers University, New Jersey, USA, 1996.
K.J. Kristoffersen and P. Pettersson. Modelling and analysis of a steam generator using Uppaal. In Proc. of the 7th Nordic Workshop on Programming Theory, Göteborg, Sweden, November 1–3 1995.
F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic — and back. In J. Wiedermann and P. Hájek, editors, Proc. of the 20th. International Symposium on Mathematical Foundations of Computer Science, MFCS'95, volume 969 of Lecture Notes in Computer Science, pages 529–539, Prague, Czech Republic, August 28–September 1 1995. Springer-Verlag.
Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, September 1991.
R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall International, 1989.
A. Olivero and S. Yovine. Kronos: a tool for verifying real-time systems. User's guide and reference manual. VERIMAG, Grenoble, France, 1993.
B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149–163, April 1994.
M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. of the 1st. Annual Symposium on Logic in Computer Science, LICS'86, pages 322–331. IEEE Computer Society Press, 1986.
M. Y. Vardi and P. Wolper. Reasoning about infinte computations. Information and Computation, 115:1–37, 1994.
Y. Wang. Real-time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proc. of the Conference on Theories of Concurrency: Unification and Extension, CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 502–520, Amsterdam, The Netherlands, August 27–30 1990. Springer-Verlag.
Y. Wang. A calculus of real time systems. PhD thesis, Chalmers university of Technology, Göteborg, Sweden, 1991.
P. Wolper. Where could SPIN go next? a unifying approach to exploring infinite state spaces. Slides for an invited talk at the 1997 SPIN Workshop, Enschede, The Netherlands. Available at the URL http://www.montefiore.ulg.ac.be/~pw/papers/psfiles/SPIN4-97.ps.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aceto, L., Burgueño, A., Larsen, K.G. (1998). Model checking via reachability testing for timed automata. In: Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1998. Lecture Notes in Computer Science, vol 1384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054177
Download citation
DOI: https://doi.org/10.1007/BFb0054177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64356-2
Online ISBN: 978-3-540-69753-4
eBook Packages: Springer Book Archive