Model checking via reachability testing for timed automata

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

Volumn 1384, Issue , 1998, Pages 265-280

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

^a AALBORG UNIVERSITY   (Denmark)

^b ONERA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INTERACTIVE COMPUTER SYSTEMS; REAL TIME SYSTEMS;

DENSE-TIME; LIVENESS PROPERTIES; REACHABILITY; REACHABILITY TESTING; TIMED AUTOMATA;

MODEL CHECKING;

EID: 84947923383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054177     Document Type: Conference Paper

References (24)

1. L. Aceto, P. Bouyer, A. Burgueñio, and K. G. Larsen. The limitations of testing for timed automata, 1997. Forthcoming paper.
2. L. Aceto, A. Burguefio, and K. G. Larsen. Model checking via reachability testing for timed automata. Research Report RS-97-29, BRICS, Aalborg University, November 1997.
3. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181-204, 1994. Preliminary version appears in Proc. 30th FOCS, 1989.
5. J. Bengtsson, D. Griffioen, K. Kristoffersen, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Verification of an audio protocol with bus collision using UPPAAL. In R. Alur and T. A. Henzinger, editors, Proc. of the 8th. International Conference on Computer-Aided Verification, CAV'96, volume 1102 of Lecture Notes in Computer Science, New Brunswick, New Jersey, USA, July 31 - August 3 1996. Springer-Verlag.
6. J. Bengtsson, K. G. Larsen, F. Larsson, F. Pettersson, and W. Yi. UPPAAL - a tool suite for automatic verification of real-time systems. In Proc. of the 4th DIMACS Workshop on Verification and Control of Hybrid Systems, New Brunswick, New Jersey, 22-24 October 1995.
7. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
8. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computer Machinery, 32(1):137-161, January 1985.
9. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: the next generation. In Proc. of the 16th Real-time Systems Symposium, RTSS'95. IEEE Computer Society press, 1995.
10. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proc. of the 27th Annual ACM Symposium on Theory of Computing, STOC'95, pages 373-382, 1995. Also appeared as Cornell University technical report TR95-1541.
11. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
12. P.-H. Ho and H. Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, editor, Proc. of the 7th. International Conference on Computer-Aided Verification, CAV'95, volume 939 of Lecture Notes in Computer Science, pages 381-394, Lige, Belgium, July 1995. Springer-Verlag.
13. H. E. Jensen, K. G. Larsen, and A. Skou. Modelling and analysis of a collision avoidance protocol using SPIN and UPPAAL. In DIMACS Workshop SPIN '96, 2nd International SPIN Verification Workshop on Algorithms, Applications, Tool Use, Theory. Rutgers University, New Jersey, USA, 1996.
14. K.J. Kristoffersen and P. Pettersson. Modelling and analysis of a steam generator using UPPAAL. In Proc. of the 7th Nordic Workshop on Programming Theory, GSteborg, Sweden, November 1-3 1995.
15. F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic – and back. In J. Wiedermann and P. Hájek, editors, Proc. of the 20th. International Symposium on Mathematical Foundations of Computer Science, MFCS'95, volume 969 of Lecture Notes in Computer Science, pages 529-539, Prague, Czech Republic, August 28 - September 1 1995. Springer-Verlag.
16. Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
17. R. Milner. Communication and Concurrency. Series in Computer Science. Prentice Hall International, 1989.
18. A. Olivero and S. Yovine. Kronos: a tool for verifying real-time systems. User's guide and reference manual. VERIMAG, Grenoble, France, 1993.
19. B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149-163, April 1994.
20. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. of the 1st. Annual Symposium on Logic in Computer Science, LICS'86, pages 322-331. IEEE Computer Society Press, 1986.
21. M. Y. Vardi and P. Wolper. Reasoning about infinte computations. Information and Computation, 115:1-37, 1994.
22. Y. Wang. Real-time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proc. of the Conference on Theories of Concurrency: Unification and Extension, CONCUR'90, volume 458 of Lecture Notes in Computer Science, pages 502-520, Amsterdam, The Netherlands, August 27-30 1990. Springer-Verlag.
23. Y. Wang. A calculus of real time systems. PhD thesis, Chalmers university of Technology, Göteborg, Sweden, 1991.
24. 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. Available at the URL http://www.Montefiore.ulg.ac.be/'pw/papers/psfiles/SPIN4-97, ps.