The power of reachability testing for timed automata

Theoretical Computer Science

Volumn 300, Issue 1-3, 2003, Pages 411-475

  Aceto, Luca ^a   Bouyer, Patricia ^b   Burgueño, Augusto ^c   Larsen, Kim G ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b CNRS   (France)

^c EUROPEAN COMMISSION   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS;

TIMED AUTOMATA;

COMPUTER SCIENCE;

EID: 0037738853     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00334-1     Document Type: Article

References (48)

1. Abramsky S., Vickers S. Quantales, observational logic and process semantics. Math. Struct. Comput. Sci. 3(2):1993;161-227.
2. L. Aceto, P. Bouyer, A. Burgueño, K.G. Larsen, The power of reachability testing for timed automata, in: Proc. 18th Conf. on Found. of Software Technology and Theoretical Computer Science (FST&TCS'98), Lecture Notes in Computer Science, Vol. 1530, Springer, Berlin, 1998. pp. 245-256. Also available as BRICS Report RS-98-48, Aalborg University, 1998.
3. L. Aceto, A. Burgueño, K.G. Larsen, Model-checking via reachability testing for timed automata, in: Proc. 4th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), Lecture Notes in Computer Science, Vol. 1384, Springer, Berlin, 1998. pp. 263-280. Also available as BRICS Report RS-97-29, Aalborg University, 1997.
4. Aceto L., Laroussinie F. Is your model-checker on time? J. Logic Algebraic Programming. 52-53:2002;7-51.
5. Alur R., Courcoubetis C., Dill D. Model-checking in dense real-time. Inform. and Comput. 104(1):1993;2-34.
6. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126(2):1994;183-235.
7. T. Amnell, G. Behrmann, J. Bengtsson, P.R. D'Argenio, A. David, A. Fehnker, T. Hune, B. Jeannet, K.G. Larsen, O. öller, P. Pettersson, C. Weise, Yi.W. UPPAAL, Now, next, and future, in: Proc. Modelling and Verification of Parallel Processes (Movep 2k),Lecture Notes in Computer Science, Tutorial, Vol. 2067, Springer, Berlin, 2001 pp. 100-125.
8. Andersen H.R. Partial model-checking (extended abstract). Proc. 10th IEEE Symp. Logic in Computer Science (LICS'95). 1995;398-407 IEEE Computer Society Press, Silver Spring, MD.
9. Bengtsson J., Griffioen W.D., Kristoffersen K.J., Larsen K.G., Larsson F., Pettersson P., Yi W. Verification of an audio protocol with bus collision using UPPAAL. Proc. 8th Internat. Conf. on Computer Aided Verification (CAV'96). Lecture Notes in Computer Science. Vol. 1102:1996;244-256 Springer, Berlin.
10. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, Y. Wang, C. Weise, New generation of UPPAAL, in: Proc. Internat. Workshop on Software Tools for Technology Transfer, 1998.
11. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, W. Yi, UPPAAL - a tool suite for automatic verification of real-time systems, in: Proc. Workshop Hybrid Systems III: Verification and Control, Lecture Notes in Computer Science, Vol. 1066, 1995, pp. 232-243.
12. Bérard B., Fribourg L. Automatic verification of a parametric real-time program: the ABR conformance protocol. Proc. 11th Internat. Conf. on Computer Aided Verification (CAV'99). Vol. 1633:1999;96-107 Springer, Berlin.
13. B. Bérard, L. Sierra, Comparing verification with HYTECH, KRONOS and UPPAAL on the railroad crossing example, Research Report LSV-00-2, Lab. Specification and Verification, ENS de Cachan, France, 2000.
14. Bloom B., Istrail S., Meyer A.R. Bisimulation can't be traced. J. Assoc. Comput. Mach. 42(1):1995;232-268.
15. Bouyer P., Dufourd C., Fleury E., Petit A. Are timed automata updatable? Proc. 12th Internat. Conf. on Computer Aided Verification (CAV'2000). Lecture Notes in Computer Science. Vol. 1855:2000;464-479 Springer, Berlin.
16. Bozga M., Daws C., Maler O., Olivero A., Tripakis S., Yovine S. Kronos, A model-checking tool for real-time systems. Proc. 10th Internat. Conf. on Computer Aided Verification (CAV'98). Lecture Notes in Computer Science. Vol. 1427:1998;546-550 Springer, Berlin.
17. Cerans K. Decidability of bisimulation equivalences for parallel timer processes. Proc. 4th Internat. Conf. on Computer Aided Verification (CAV'92). Lecture Notes in Computer Science. Vol. 663:1992;302-315 Springer, Berlin.
18. Courcoubetis C., Yannakakis M. Minimum and maximum delay problems in real-time systems. Formal methods in System Design. 1992;385-415.
19. Daws C., Yovine S. Two examples of verification of multivariate timed automata with KRONOS. Proc. 16th IEEE Real-Time Systems Symposium (RTSS'95). 1995;66-75 IEEE Computer Society Press, Silver Spring, MD.
20. De Nicola R., Hennessy M. Testing equivalences for processes. Theoret. Comput. Sci. 34:1984;83-133.
21. Gabbay D.M., Pnueli A., Shelah S., Stavi J. On the temporal analysis of fairness. Proc. 6th ACM Symp. on Principles of Programming Languages. Lecture Notes in Computer Science. Vol. 1384:1980;163-173 Springer, Berlin.
22. Henzinger T.A., Ho P.-H., Wong-Toi H. HYTECH: the next generation. Proc. 16th IEEE Real-Time Systems Symposium (RTSS'95). 1995;56-65 IEEE Computer Society Press, Silver Spring, MD.
23. T. Henzinger, P. Ho, H. Wong-Toi, HyTech: a model checker for hybrid systems, in: Software Tools for Technology Transfer, 1997, pp. 110-122.
24. T.A. Henzinger, P.W. Kopke, Undecidability results for hybrid systems, in: Proc. Workshop on Hybrid Systems and Autonomous Control, 1994. Also appeared as Cornell University Technical Report TR95-1483.
25. T.A. Henzinger, P.W. Kopke, A. Puri, P. Varaiya, What's decidable about hybrid automata? in: Proc. 27th ACM Symp. Theory of Computing (STOC'95), 1995, pp. 373-382. Also appeared as Cornell University Technical Report TR95-1541.
26. Ho P.-H., Wong-Toi H. Automated analysis of an audio control protocol. Proc. 7th. Internat. Conf. on Computer Aided Verification (CAV'95). Lecture Notes in Computer Science. Vol. 939:1995;381-394 Springer, Berlin.
27. T.K. Iversen, K.J. Kristoffersen, K.G. Larsen, M. Laursen, R.G. Madsen, S.K. Mortensen, P. Pettersson, C.B. Thomasen, Model-checking real-time control programs - verifying LEGO mindstorms systems using UPPAAL, in: Proc. 12th Euromicro Conf. on Real-Time Systems (ECRTS'00). 2000. Also available as BRICS Report RS-99-53, Aalborg University, 1999.
28. H.E. Jensen, K.G. Larsen, A. Skou, Modelling and analysis of a collision avoidance protocol using SPIN and UPPAAL, in: Proc. 2nd SPIN Verification Workshop on Algorithms, Applications, Tool Use, Theory. American Mathematical Society, Providence, RI, 1996. Also available as BRICS Report RS-96-24, Aalborg University, 1996.
29. Kleene S.C. Representation of events in nerve nets and finite automata. Automata Studies. 1956;3-41 Princeton University Press, Princeton, NJ.
30. K.J. Kristoffersen, P. Pettersson, Modelling and analysis of a steam generator using UPPAAL, in: Proc. 7th Nordic Workshop on Programming Theory, 1995.
31. F. Laroussinie, K.G. Larsen, Compositional model-checking of real-time systems, in: Proc. 6th Internat. Conf. on Theory of Concurrency (CONCUR'95), Lecture Notes in Computer Science, Vol. 962, Springer, Berlin, 1995, pp. 529-539. Also available as BRICS Report RS-95-19, Aalborg University, 1995.
32. 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.
33. F. Laroussinie, K.G. Larsen, C. Weise, From timed automata to logic - and back, in: Proc. 20th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'95), Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 27-41. Also available as BRICS Report RS-95-2, Aalborg University, 1995.
34. Larsen K.G. Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoret. Comput. Sci. 72(2-3):1990;265-288.
35. Larsen K.G., Pettersson P., Yi W. UPPAAL in a Nutshell. J. Software Tools Technol. Transfer. 1(1-2):1997;134-152.
36. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94:1991;1-28.
37. Larsen K.G., Xinxin L. Compositionality through an operational semantics of contexts. J. Logic Comput. 1:1991;761-795.
38. Margenstern M. Frontier between decidability and undecidability. a survey Theoret. Comput. Sci. 231(2):2000;217-251.
39. Milner R. Communication and Concurrency. 1989;Prentice-Hall International, Englewood Cliffs, NJ.
40. Olivero A., Yovine S. KRONOS: A Tool for Verifying Real-Time Systems. User's Guide and Reference Manual. 1993;VERIMAG, Grenoble, France.
41. Steffen B., Ingólfsdóttir A. Characteristic formulae for processes with divergence. Inform. and Comput. 110(1):1994;149-163.
42. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5:1955;285-309.
43. Taşiran S., Brayton R.K. STARI: a case study in compositional verification and hierarchical timing verification. Proc. 9th Internat. Conf. on Computer Aided Verification (CAV'97). Lecture Notes in Computer Science. Vol. 1254:1997;191-201 Springer, Berlin.
44. Vardi M.Y., Wolper P. An automata-theoretic approach to automatic program verification. Proc. 1st Ann. Symp. on Logic in Computer Science (LICS'86). 1986;322-331 IEEE Computer Society Press, Silver Spring, MD.
45. P. Wolper, Where could SPIN go next? A unifying approach to exploring infinite state spaces. Slides for an invited talk at the 1997 SPIN Workshop, Enschede, The Netherlands, 1997. Available at the URL http://www.montefiore.ulg.ac.be/̃pw/papers/psfiles/SPIN4-97.ps.
46. Yi W. Real-time behaviour of asynchronous agents. Proc. 1st Internat. Conf. on Theory of Concurrency (CONCUR'90). Lecture Notes in Computer Science. Vol. 458:1990;502-520 Springer, Berlin.
47. W. Yi, A calculus of real-time systems, Ph.D. Thesis, Chalmers University of Technology, Göteborg, Sweden, 1991.
48. Yovine S. KRONOS. a verification tool for real-time systems J. Software Tools Technol. Transfer. 1(1-2):1997;123-133.