Abstract
Timed automata are a widely studied model for real-time systems. Since 8 years, several tools implement this model and are successfully used to verify real-life examples. In spite of this well-established framework, we prove that the forward analysis algorithm implemented in these tools is not correct! However, we also prove that it is correct for a restricted class of timed automata, which has been sufficient for modeling numerous real-life systems.
Partly supported by the French RNRT Project Calife
Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation. 1 http://www-cad.eecs.berkeley.edu:80/∼tah/HyTech/ 2 http://www-verimag.imag.fr/TEMPORISE/kronos/ 3 http://www.uppaal.com/
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rajeev Alur, Costas Courcoubetis, David Dill, Nicolas Halbwachs and Howard Wong-Toi. An Implementation of Three Algorithms for TimingVerification Based on Automata Emptiness. In Proc. 13th IEEE Real-Time Systems Symposium (RTSS’92), pp. 157–166. IEEE Computer Society Press, 1992.
Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David Dill and Howard Wong-Toi. Minimization of Timed Transition Systems. In Proc. 3rd International Conference on Concurrency Theory (CONCUR’92), vol. 630 of Lecture Notes in Computer Science, pp. 340–354. Springer, 1992.
Rajeev Alur, Costas Courcoubetis and Thomas A. Henzinger. The Observational Power of Clocks. In Proc. 5th International Conference on Concurrency Theory (CONCUR’94), vol. 836 of Lecture Notes in Computer Science, pp. 162–177. Springer, 1994.
Rajeev Alur and David Dill. A Theory of Timed Automata. Theoretical Computer Science (TCS), vol. 126(2):pp. 183–235, 1994.
Rajeev Alur, Limor Fix and Thomas A. Henzinger. A Determinizable Class of Timed Automata. In Proc. 6th International Conference on Computer Aided Verification (CAV’94), vol. 818 of Lecture Notes in Computer Science, pp. 1–13. Springer, 1994.
Béatrice Bérard, Patricia Bouyer and Antoine Petit. Analysing the PGM Protocol with Uppaal. In Proc. 2nd Workshop on Real-Time Tools (RT-TOOLS’02). 2002. Proc. published as Technical Report 2002-025, Uppsala University, Sweden.
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury and Antoine Petit. Are Timed Automata Updatable?. In Proc. 12th International Conference on Computer Aided Verification (CAV’2000), vol. 1855 of Lecture Notes in Computer Science, pp. 464–479. Springer, 2000.
Béatrice Bérard, Volker Diekert, Paul Gastin and Antoine Petit. Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticae, vol. 36(2–3):pp. 145–182, 1998.
Johan Bengtsson. Clocks, DBMs ans States in Timed Systems. Ph.D. thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2002.
Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn and Frits Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. In Proc. 4th International Workshop on Hybrid Systems: Computation and Control (HSCC’01), vol. 2034 of Lecture Notes in Computer Science, pp. 147–161. Springer, 2001.
Johan Bengtsson and Fredrik Larsson. UPPAAL, a Tool for Automatic Verification of Real-Time Systems. Master’s thesis, Department of Computer Science, Uppsala University, Sweden, 1996.
Gerd Behrmann, Kim G. Larsen, Justin Pearson, Carsten Weise and Wang Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proc. 11th International Conference on Computer Aided Verification (CAV’99), vol. 1633 of Lecture Notes in Computer Science, pp. 341–353. Springer, 1999.
Patricia Bouyer. Modéles et algorithmes pour la vérification des systémes temporisés. Ph.D. thesis, École Normale Supérieure de Cachan, Cachan, France, 2002.
Patricia Bouyer. Timed Automata May Cause Some Troubles. Research Report LSV-02-9, Laboratoire Spécification etVérification, ENS de Cachan, France, 2002. AlsoAvailable as BRICS Research Report RS-02-35, Aalborg University, Denmark, 2002.
Ahmed Bouajjani, Stavros Tripakis and Sergio Yovine. On-the-Fly Symbolic Model-Checking for Real-Time Systems. In Proc. 18th IEEE Real-Time Systems Symposium (RTSS’97), pp. 25–35. IEEE Computer Society Press, 1997.
Christian Choffrut and Massimiliano Goldwurm. Timed Automata with Periodic Clock Constraints. Journal of Automata, Languages and Combinatorics (JALC), vol. 5(4):pp. 371–404, 2000.
Edmund Clarke, Orna Grumberg and Doron Peled. Model-Checking. The MIT Press, Cambridge, Massachusetts, 1999.
Conrado Daws. Analyse par simulation symbolique des systèmes temporisés avec KRONOS. Research report, Verimag, 1997.
Conrado Daws. Méthodes d’analyse de systèmes temporisés: de la théorie à la pratique. Ph.D. thesis, Institut National Polytechnique de Grenoble, Grenoble, France, 1998.
David Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, vol. 407 of Lecture Notes in Computer Science, pp. 197–212. Springer, 1989.
Conrado Daws, Alfredo Olivero, Stavros Tripakis and Sergio Yovine. The Tool KRONOS. In Proc. Hybrid Systems III: Verification and Control (1995), vol. 1066 of Lecture Notes in Computer Science, pp. 208–219. Springer, 1996.
Conrado Daws and Stavros Tripakis. Model-Checking of Real-Time Reachability Properties using Abstractions. In Proc. 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), vol. 1384 of Lecture Notes in Computer Science, pp. 313–329. Springer, 1998.
François Demichelis and Wieslaw Zielonka. Controlled Timed Automata. In Proc. 9th International Conference on Concurrency Theory (CONCUR’98), vol. 1466 of Lecture Notes in Computer Science, pp. 455–469. Springer, 1998.
Thomas A. Henzinger, Pei-Hsin Ho and Howard Wong-Toi. HyTech: A Model-Checker for Hybrid Systems. Journal on Software Tools for Technology Transfer (STTT), vol. 1(1–2):pp. 110–122, 1997.
Thomas A. Henzinger, Peter W. Kopke and Howard Wong-Toi. The Expressive Power of Clocks. In Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP’95), vol. 944 of Lecture Notes in Computer Science, pp. 417–428. Springer, 1995.
Thomas A. Henzinger, Jean-François Raskin and Pierre-Yves Schobbens. The Regular Real-Time Languages. In Proc. 25th International Colloquium on Automata, Languages and Programming (ICALP’98), vol. 1443 of Lecture Notes in Computer Science, pp. 580–591. Springer, 1998.
Klaus Havelund, Arne Skou, Kim G. Larsen and Kristian Lund. Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using Uppaal. In Proc. 18th IEEE Real-Time Systems Symposium (RTSS’97), pp. 2–13. IEEE Computer Society Press, 1997.
Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer (STTT), vol. 1(1–2):pp. 134–152, 1997.
Paul Pettersson. Modelling and Verification of Real-Time Systems Using Timed Automata: Theory and Practice. Ph.D. thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1999. Available as DoCS Technical Report 99/101.
Stavros Tripakis. L’analyse formelle des systèmes temporisés en pratique. Ph.D. thesis, Université Joseph Fourier, Grenoble, France, 1998.
Stavros Tripakis and Sergio Yovine. Verification of the Fast Reservation Protocol with Delayed Transmission using the Tool Kronos. In Proc. 4th IEEE Real-Time Technology and Applications Symposium (RTAS’98), pp. 165–170. IEEE Computer Society Press, 1998.
Stavros Tripakis and Sergio Yovine. Analysis of Timed Systems using Time-Abstracting Bisimulations. Formal Methods in System Design, vol. 18(1):pp. 25–68, 2001.
Thomas Wilke. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In Proc. 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT’94), vol. 863 of Lecture Notes in Computer Science, pp. 694–715. Springer, 1994.
Howard Wong-Toi. Symbolic Approximations for Verifying Real-Time Systems. Ph.D. thesis, Stanford University, USA, 1994.
Mihalis Yannakakis and David Lee. An Efficient Algorithm for Minimizing Real-Time Transition Systems. Formal Methods in System Design, vol. 11(2):pp. 113–136, 1997.
Sergio Yovine. Model-Checking Timed Automata. In School on Embedded Systems, vol. 1494 of Lecture Notes in Computer Science, pp. 114–152. Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouyer, P. (2003). Untameable Timed Automata!. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_54
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive