Abstract
In this paper we suggest numerical decision diagrams, a bdd-based data-structure for representing certain subsets of the Euclidean space, namely those encountered in verification of timed automata. Unlike other representation schemes, ndd's are canonical and provide for all the necessary operations needed in the verification and synthesis of timed automata. We report some preliminary experimental results.
This research was supported in part by the European Community projects HYBRID EC-US-043 and INTAS-94-697. Verimag is a joint laboratory of cnrs and ujf.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183–235, 1994.
R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. In IEEE Real-time Systems Symposium, pages 2–11, 1993.
J. Bengtsson, W.O.D. Griffioen, K.J. Kristoffersen, 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 (Eds. Proc. CAV'96, LNCS 1102, 244–256, Springer, 1996.
R.E. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers C-35, 677–691, 1986.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang, Symbolic Model-Checking: 1020 States and Beyond, Proc. LICS'90, Philadelphia, 1990.
S.V. Campos and E.M. Clarke. Real-time symbolic model checking for discrete time models, in T. Rus and C. Rattray (Eds.), AMAST Series in Computing: Theories and Experiences for Real-Time System Development, World Scientific, 1995.
C. Daws, A. Olivero and S. Yovine, Verifying et-lotos Programs with Kronos, Proc. FORTE'94, Bern, 1994.
D.L. Dill, Timing Assumptions and Verification of Finite-State Concurrent Systems, in J. Sifakis (Ed.), Automatic Verification Methods for Finite State Systems, LNCS 407, Springer, 1989.
M. Bozga, J.-C. Fernandez, A. Kerbrat, A Symbolic μ-calculus Model Checker for Automata with Variables, Unpublished Manuscript, Verimag, 1996.
A. Göllü, A. Puri and P. Varaiya, Discretization of Timed Automata, Proc. 33rd CDC, 1994.
T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic Model-checking for Real-time Systems, Information and Computation 111, 193–244, 1994.
O. Maler and A. Pnueli, Timing Analysis of Asynchronous Circuits using Timed Automata, in P.E. Camurati and H. Eveking (Eds.), Proc. CHARME'95, 189–205, LNCS 987, Springer, 1995.
K.L. McMillan, Symbolic Model-Checking: an Approach to the State-Explosion problem, Kluwer, 1993.
F. Somenzi, CUDD: CU Decision Diagram Package, 1995.
A. Rauzy, Toupie=μ-calculus + constraints. In P. Wolper, editor, Proc. CAV'95, LNCS 939, 114–126, Springer, 1995.
P. Wolper and B. Boigelot. An automata-theoretic approach to presburger arithmetic constraints. In Proc. Static Analysis Symposium, LNCS 983, 21–32, Springer, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A., Rasse, A. (1997). Data-structures for the verification of timed automata. In: Maler, O. (eds) Hybrid and Real-Time Systems. HART 1997. Lecture Notes in Computer Science, vol 1201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014737
Download citation
DOI: https://doi.org/10.1007/BFb0014737
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62600-8
Online ISBN: 978-3-540-68330-8
eBook Packages: Springer Book Archive