Abstract
For the formal specification and verification of real-time systems we use the modular formalism Cottbus Timed Automata (CTA), which is an extension of timed automata [AD94]. Matrix-based algorithms for the reachability analysis of timed automata are implemented in tools like Kronos, Uppaal, HyTech and Rabbit. A new BDD-based version of Rabbit, which supports also refinement checking, is now available.
Chapter PDF
Similar content being viewed by others
References
Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
Dirk Beyer. Improvements in BDD-based reachability analysis of timed automata. In Proc. FME2001, LNCS 2021, pages 318–343. Springer-Verlag, 2001.
M. Bozga, O. Maler, A. Pnueli, and S. Yovine. Some progress on the symbolic verification of timed automata. In Proc. CAV’97, LNCS 1254, pages 179–190. 1997.
Dirk Beyer and Andreas Noack. Efficient verification of timed automata using BDDs. In Proc. Formal Methods for Industrial Critical Systems. to appear, 2001.
Dirk Beyer and Heinrich Rust. Modeling a production cell as a distributed real-time system with Cottbus Timed Automata. Proc. FBT’98, pages 148–159. Shaker, 1998.
Dirk Beyer and Heinrich Rust. Cottbus Timed Automata: Formal definition and semantics. In Proc. FSCBS 2001, pages 75–87, 2001.
David L. Dill, Alan J. Hu, and Howard Wong-Toi. Checking for language inclusion using simulation preorders. In Proc. CAV’91, LNCS 575, pages 255–265. 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beyer, D. (2001). Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs. In: Margaria, T., Melham, T. (eds) Correct Hardware Design and Verification Methods. CHARME 2001. Lecture Notes in Computer Science, vol 2144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44798-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-44798-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42541-0
Online ISBN: 978-3-540-44798-6
eBook Packages: Springer Book Archive