Updatable timed automata

Theoretical Computer Science

Volumn 321, Issue 2-3, 2004, Pages 291-345

  Bouyer, Patricia ^a   Dufourd, Catherine ^b   Fleury, Emmanuel ^c   Petit, Antoine ^a  

^a CNRS   (France)

^b EDF R AND D   (France)

^c AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONSTRAINT THEORY; DECISION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS;

DIOPHANTINE INEQUATIONS SYSTEMS; UPDATABLE TIMED AUTOMATA;

COMPUTER SCIENCE;

EID: 3242713896     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.003     Document Type: Article

References (39)

1. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, 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), IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 157-166.
2. R. Alur, C. Courcoubetis, T.A. Henzinger, The observational power of clocks, in: Proc. Fifth Internat. Conf. on Concurrency Theory (CONCUR'94), Lecture Notes in Computer Science, Vol. 836, Springer, Berlin, 1994, pp. 162-177.
3. R. Alur, D. Dill, Automata for modeling real-time systems, in: Proc. 17th Internat. Coll. on Automata, Languages and Programming (ICALP'90), Lecture Notes in Computer Science, Vol. 443, Springer, Berlin, 1990, pp. 322-335.
4. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126(2):1994;183-235.
5. R. Alur, L. Fix, T.A. Henzinger, A determinizable class of timed automata, in: Proc. Sixth Internat. Conf. on Computer Aided Verification (CAV'94), Lecture Notes in Computer Science, Vol. 818, Springer, Berlin, 1994, pp. 1-13.
6. R. Alur, T.A. Henzinger, M. Vardi, Parametric real-time reasoning, in: Proc. 25th Annu. ACM Symp. on the Theory of Computing (STOC'93), ACM, New York, 1993, pp. 592-601.
7. G. Behrmann, P. Bouyer, E. Fleury, K.G. Larsen, Static guard analysis in timed automata verification, in: Proc. Nineth Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2003), Lecture Notes in Computer Science, Vol. 2619, Springer, Berlin, 2003, pp. 254-277.
8. B. Bérard, P. Bouyer, A. Petit, Analysing the PGM protocol with UPPAAL, in: Proc. Second Workshop on Real-Time Tools (RT-TOOLS'02), Proc. published as Tech. Report 2002-025, Uppsala University, Sweden, 2002.
9. Bérard B., Dufourd C. Timed automata and additive clock constraints. Inform. Process. Lett. 75(1-2):2000;1-7.
10. P. Bouyer, C. Dufourd, E. Fleury, A. Petit, Are timed automata updatable?, in: Proc. 12th Internat. Conf. on Computer Aided Verification (CAV'2000), Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 464-479.
11. P. Bouyer, C. Dufourd, E. Fleury, A. Petit, Expressiveness of updatable timed automata, in: Proc. 25th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'2000), Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000, pp. 232-242.
12. Bérard B., Diekert V., Gastin P., Petit A. Characterization of the expressive power of silent transitions in timed automata. Fund. Inform. 36(2-3):1998;145-182.
13. B. Bérard, L. Fribourg, Automated verification of a parametric real-time program: the ABR conformance protocol, in: Proc. 11th Internat. Conf. Computer Aided Verification (CAV'99), Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, 1999, pp. 96-107.
14. Bérard B., Fribourg L., Klay F., Monin J. A compared study of two correctness proofs for the standardized algorithm of ABR conformance. Formal Meth. System Des. 22(1):2003;59-86.
15. B. Bérard, P. Gastin, A. Petit, On the power of non-observable actions in timed automata, in: Proc. 13th Annu. Symp. on Theoretical Aspects of Computer Science (STACS'96), Lecture Notes in Computer Science, Vol. 1046, Springer, Berlin, 1996, pp. 257-268.
16. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, W. Yi, C. Weise, New generation of UPPAAL, in: Proc. Internat. Workshop on Software Tools for Technology Transfer (STTT'98), BRICS Notes Series, 1998, pp. 43-52.
17. P. Bouyer, Untameable timed automata! in: Proc. 20th Annu. Symp. on Theoretical Aspects of Computer Science (STACS'03), Lecture Notes in Computer Science, Vol. 2607, Springer, Berlin, 2003, pp. 620-631.
18. Choffrut C., Goldwurm M. Timed automata with periodic clock constraints. J. Automata, Languages Combin. (JALC). 5(4):2000;371-404.
19. C. Daws, A. Olivero, S. Tripakis, S. Yovine, The tool KRONOS, in: Proc. Hybrid Systems III: Verification and Control (1995), Lecture Notes in Computer Science, Vol. 1066, Springer, Berlin, 1996, pp. 208-219.
20. C. Daws, A. Olivero, S. Yovine, Verifying et-lotos programs with KRONOS, in: Proc. Seventh Internat. Conf. on Formal Description Techniques (FORTE'94), Chapman & Hall, London, 1994, pp. 227-242.
21. F. Demichelis, W. Zielonka, Controlled timed automata, in: Proc. Nineth Internat. Conf. on Concurrency Theory (CONCUR'98), Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 455-469.
22. V. Diekert, P. Gastin, A. Petit, Removing -transitions in timed automata, in: Proc. 14th Annu. Symp. on Theoretical Aspects of Computer Science (STACS'97), Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 583-594.
23. E. Domenjoud, Solving systems of linear diophantine equations: an algebraic approach, in: Proc. 16th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'91), Lecture Notes in Computer Science, Vol. 520, Springer, Berlin, 1991, pp. 141-150.
24. C. Dufourd, Une extension d'un résultat d'indécidabilité pour les automates temporisés, in: Proc. Ninth Rencontres Francophones du Parallélisme (RenPar'97), 1997.
25. T.A. Henzinger, P.-H. Ho, H. Wong-Toi, A user guide to HYTECH, in: Proc. First Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), Lecture Notes in Computer Science, Vol. 1019, Springer, Berlin, 1995, pp. 41-71.
26. Henzinger T.A., Ho P.-H., Wong-Toi H. HYTECH. A model-checker for hybrid systems J. Software Tools for Technol. Transfer (STTT). 1(1-2):1997;110-122.
27. T.A. Henzinger, P.W. Kopke, H. Wong-Toi, The expressive power of clocks, in: Proc. 22nd Internat. Coll. on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, Vol. 944, Springer, Berlin, 1995, pp. 417-428.
28. K. Havelund, A. Skou, K.G. Larsen, 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). IEEE Computer Society Press, 1997, pp. 2-13.
29. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages and Computation. 1979;Addison-Wesley, Reading, MA.
30. H.E. Jensen, K.G. Larsen, A. Skou, Modelling and analysis of a collision avoidance protocol using SPIN and UPPAAL, in: Proc. Second SPIN Verification Workshop on Algorithms, Applications, Tool Use, Theory, American Mathematical Society, Providence, RI, 1996.
31. F. Laroussinie, K.G. Larsen, CMC: A tool for compositional model-checking of real-time systems, in: Proc. IFIP Joint Internat. Conf. on Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV'98), Kluwer Academic, Dordrecht, 1998, pp. 439-456.
32. Larsen K.G., Pettersson P., Yi W. UPPAAL in a nutshell. J. Software Tools for Technology Transfer (STTT). 1(1-2):1997;134-152.
33. Milner R. Communication and Concurrency. 1989;Prentice-Hall International, Englewood Cliffs, NJ.
34. Minsky M. Computation: Finite and Infinite Machines. 1967;Prentice-Hall International, Englewood Cliffs, NJ.
35. D. Park, Concurrency and automata on infinite sequences, in: Proc. Fifth Conf. on Theoretical Computer Science (TCS'81), Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167-183.
36. T. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, in: Proc. Third Internat. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94) Lecture Notes in Computer Science, Vol. 863, Springer, Berlin, 1994, pp. 694-715.
37. W. Yi, Real-time behaviour of asynchronous agents, in: Proc. First Internat. Conf. on Theory of Concurrency (CONCUR'90), Lecture Notes in Computer Science, Vol. 458, Springer, Berlin, 1990, pp. 502-520.
38. W. Yi, A Calculus of Real-Time Systems, Ph.D. Thesis, Chalmers University of Technology, Göteborg, Sweden, 1991.
39. Yovine S. KRONOS: A verification tool for real-time systems. J. Software Tools Technology Transfer (STTT). 1(1-2):1997;123-133.