Lower and Upper Bounds in Zone Based Abstractions of Timed Automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2988, Issue , 2004, Pages 312-326

  Behrmann, Gerd ^a   Bouyer, Patricia ^b   Larsen, Kim G ^b   Pelánek, Radek ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b CNRS   (France)

^c MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; MODEL CHECKING; SEMANTICS;

DIFFERENCE BOUND MATRICES; LOWER AND UPPER BOUNDS; NORMAL FORM; REACHABILITY; REAL TIME MODELING; SOUNDNESS AND COMPLETENESS; TIMED AUTOMATA; ZONE-BASED;

MATRIX ALGEBRA;

EID: 33745470484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_25     Document Type: Article

References (14)

1. [AD90] Rajeev Alur and David Dill. Automata for modeling real-time systems. In Proc. 17th International Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 of Lecture Notes in Computer Science, pages 322-335. Springer, 1990.
2. [AD94] Rajeev Alur and David Dill. A theory of timed automata. Theoretical Computer Science (TCS), 126(2):183-235, 1994.
3. [AM01] Yasmina Abdeddaim and Oded Maler. Job-shop scheduling using timed automata. In Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of Lecture Notes in Computer Science, pages 478-492. Springer, 2001.
4. [BBFL03] Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, and Kim G. Larsen. Static guard analysis in timed automata verification. In Proc. 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2003), volume 2619 of Lecture Notes in Computer Science, pages 254-277. Springer, 2003.
5. +98] Marius Bozga, Conrado Daws, Oded Maler, Alfredo Olivero, Stavros Tripakis, and Sergio Yovine. KRONOS: a model-checking tool for real-time systems. In Proc. 10th International Conference on Computer Aided Verification (CAV'98), volume 1427 of Lecture Notes in Computer Science, pages 546-550. Springer, 1998.
6. [Ben02] Johan Bengtsson. Clocks, DBMs ans States in Timed Systems. PhD thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2002.
7. [Bou02] Patricia Bouyer. Timed automata may cause some troubles. Research Report LSV-02-9, Laboratoire Spécification et Vérification, ENS de Cachan, France, 2002. Also Available as BRICS Research Report RS-02-35, Aalborg University, Denmark, 2002.
8. [Bou03] Patricia Bouyer. Untameable timed automata! In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), volume 2607 of Lecture Notes in Computer Science, pages 620-631. Springer, 2003.
9. [CGP99] Edmund Clarke, Orna Grumberg, and Doron Peled. Model-Checking. The MIT Press, Cambridge, Massachusetts, 1999.
10. [Dil89] David Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 197-212. Springer, 1989.
11. [DT98] 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), volume 1384 of Lecture Notes in Computer Science, pages 313-329. Springer, 1998.
12. [LLPY97] Kim G. Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. Efficient verification of real-time systems: Compact data structure and state-space reduction. In Proc. 18th IEEE Real-Time Systems Symposium (RTSS'97), pages 14-24. IEEE Computer Society Press, 1997.
13. [LPY97] Kim G. Larsen, Paul Pettersson, and Wang Yi. UPPAAL in a nutshell. Journal of Software Tools for Technology Transfer (STTT), 1(1-2):134-152, 1997.
14. [Rok93] Tomas G. Rokicki. Representing and Modeling Digital Circuits. PhD thesis, Stanford University, Stanford, USA, 1993.