Static guard analysis in timed automata verification

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

Volumn 2619, Issue , 2003, Pages 254-270

  Behrmann, Gerd ^a   Bouyer, Patricia ^b   Fleury, Emmanuel ^a   Larsen, Kim G ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLOCKS; LOCATION;

FINITE ABSTRACTION; INFINITE STATE SPACE; LOCATION BASED; REACHABILITY; SOUND AND COMPLETE; TIMED AUTOMATA;

ABSTRACTING;

EID: 35248852877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_18     Document Type: Article

References (21)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An Implementation of Three Algorithms for Timing Verification Based on Automata Emptiness. In Proc. 13th IEEE Real-Time Systems Symp. (RTSS'92), pp. 157-166. IEEE Computer Society Press, 1992.
2. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of Timed Transition Systems. In Proc. 3rd Int. Conf. on Concurrency Theory (CONCUR'92), vol. 630 of LNCS, pp. 340-354. Springer, 1992.
3. R. Alur and D. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proc. 11th Int. Conf. on Computer Aided Verification (CAV'99), vol. 1633 of LNCS, pp. 341-353. Springer, 1999.
5. J. Bengtsson. Clocks, DBMs ans States in Timed Systems. PhD thesis, Dept. of Information Technology, Uppsala Univ., Uppsala, Sweden, 2002.
6. J. Bengtsson, K. G. Larsen, Fredrik Larsson, P. Pettersson, W. Yi, and Carsten Weise. New Generation of UPPAAL. In Proc. Int. Workshop on Software Tools for Technology Transfer (STTT'98), BRICS Notes, pp. 43-52, 1998.
7. A. Boudet and H. Comon. Diophantine Equations, Presburger Arithmetic and Finite Automata. In Proc. 21st Int. Coll. on Trees in Algebra and Programming (CAAP'96), vol. 1059 of LNCS, pp. 30-43. Springer, 1996.
8. P. Bouyer. Timed Automata May Cause Some Troubles. Research Report LSV-02-9, LSV, ENS de Cachan, France, 2002.
9. P. Bouyer. Untameable Timed Automata! In Proc. 20th Annual Symp. on Theoretical Aspects of Computer Science (STACS'2003), 2003. To appear.
10. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In Proc. 12th Int. Conf. on Computer Aided Verification (CAV'2000), vol. 1855 of LNCS, pp. 464-479. Springer, 2000.
11. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. In Proc. 25th Int. Symp. on Mathematical Foundations of Computer Science (MFCS'2000), vol. 1893 of LNCS, pp. 232-242. Springer, 2000.
12. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. KRONOS: a Model-Checking Tool for Real-Time Systems. In Proc. 10th Int. Conf. on Computer Aided Verification (CAV'98), vol. 1427 of LNCS, pp. 546-550. Springer, 1998.
13. V. Braberman, D. Garbervetsky, and A. Olivero. Improving the Verification of Timed Systems Using Influence Information. In Proc. 8th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), vol. 2280 of LNCS, pp. 21-36. Springer, 2002.
14. E. Clarke, O. Grumberg, and D. Peled. Model-Checking. The MIT Press, 1999.
15. C. Daws and S. Tripakis. Model-Checking of Real-Time Reachability Properties using Abstractions. In Proc. 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), vol. 1384 of LNCS, pp. 313-329. Springer, 1998.
16. D. 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 LNCS, pp. 197-212. Springer, 1989.
17. E. Domenjoud. Solving Systems of Linear Diophantine Equations: an Algebraic Approach. In Proc. 16th Int. Symp. on Mathematical Foundations of Computer Science (MFCS'91), vol. 520 of LNCS, pp. 141-150. Springer, 1991.
18. K. Havelund, A. Skou, K.G. Larsen, and K. Lund. Formal Modeling and Analysis of an Audio/Video Protocol: an Industrial Case Study using UPPAAL. In Proc. 18th IEEE Real-Time Systems Symp. (RTSS'97), pp. 2-13. IEEE Computer Society Press, 1997.
19. F. Laroussinie and K.G. Larsen. CMC: a Tool for Compositional Model-Checking of Real-Time Systems. In Proc. IFIP Int. Conf. on Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV'98), pp. 439-456. Kluwer Academic, 1998.
20. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Software Tools for Technology Transfer, 1(1-2):134-152, 1997.
21. J. Møller, J. Lichtenberg, H.R. Andersen, and H. Hulgaard. Difference Decision Diagrams. In Proc. 13th Int. Workshop on Computer Science Logic (CSL'99), vol. 1683 of LNCS, pp. 111-125. Springer, 1999.