The impressive power of stopwatches

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

Volumn 1877 LNCS, Issue , 2000, Pages 138-152

  Cassez, Franck ^a   Larsen, Kim ^b  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EXPRESSIVE POWER; LINEAR HYBRID AUTOMATA; REACHABILITY ANALYSIS; REAL TIME; STOPWATCH AUTOMATA; TIMED AUTOMATA; TIMED LANGUAGES; VERIFICATION TOOLS; UNOBSERVABLE;

STOP WATCHES;

EID: 84885223483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_12     Document Type: Conference Paper

References (25)

1. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse. Data-Structures for the Verification of Timed Automata. In Proc. of HART'97, LNCS 1201, 1997.
2. Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. The observational power of clocks. In Bengt Jonsson and Joachim Parrow, editors, CONCUR '94: Concurrency Theory, 5th International Conference, Volume 836 of Lecture Notes in Computer Science, pages 162-177, Uppsala, Sweden, 22-25August 1994. Springer-Verlag.
3. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science B, 137, January 1995.
4. Rajeev Alur and David Dill. A theory of timed automata. Theoreti cal Computer Science B, 126: 183-235, 1994.
5. Rajeev Alur, Thomas A. Henziger, and Hei-Hsin Ho. Automatic symbolic verification of embedded systems. IEEE Transactions On Software Engineering, 22(3): 181-201, March 1996.
6. A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In David L. Dill, editor, Proceedings of the sixth In-ternational Conference on Computer-Aided Verification CAV, Volume 818 of Lecture Notes in Computer Science, pages 95-104, Standford, California, USA, June 1994. Springer-Verlag.
7. A. Bouajjani and R. Robbana. Verifying omeg-regular properties for a subclass of linear hybrid systems. In P. Wolper, editor, Proceedings of the 7th International Conference On Computer Aided Verification, Volume 939 of Lecture Notes in Computer Science, pages 437-450, Liege, Belgium, July 1995. Springer Verlag.
8. Patricia Bouyer, Christine Dufourd, Eric Fleury, and Antoine Petit. Decid-able updatable timed automata are bisimilar to timed automata. Research report, LSV, ENS Cachan, 2000. Forthcoming.
9. B. Bérard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta In-formaticæ, 36: 145-182, 1998.
10. B. Bérard and L. Fribourg. Automated verification of a parametric real-time program: the ABR conformance protocol. In Proc. 11th Int. Conf. Computer Aided Verification (CAV'99), Trento, Italy, July 1999, Volume 1633 of Lecture Notes in Computer Science, pages 96-107. Springer, 1999.
11. Béatrice Berard, Paul Gastin, and Antoine Petit. On the power of non-observable actions in timed automata. In 13th Annual Symposium on Theoretical Aspects of Computer Science, Volume 1046 of LNCS, pages 257-268, Grenoble, France, 22-24 February 1996. Springer.
12. Gerd Behrmann, Kim G. Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient timed reachability analysis using clock difference diagrams. In 11th Computer-Aided Verification, Trento, Italy, July 1999.
13. K. Cerans. Algorithmic problems in analysis in analysis of real-time specifications. PhD thesis, University of Latvia, 1992.
14. Volker Diekert, Paul Gastin, and Antoine Petit. Removing ε-transitions in timed automata. In R. Reischuk, editor, Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science 1997, number 1200 in Lecture Notes in Computer Science, pages 583-594, Berlin-Heidelberg-New York, 1997. Springer.
15. th Annual IEEE Symposium on Logic in Computer Science, pages 278-292, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
16. Thomas A. Henzinger and Peter W. Kopke. State equivalences for rectangular hybrid automata. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference, Volume 1119 of Lecture Notes in Computer Science, pages 530-545, Pisa, Italy, 26-29 August 1996. Springer-Verlag.
17. Thomas A. Henzinger and Peter W. Kopke. Discrete-time control for rectangular hybrid automata. In Pierpaolo Degano, Robert Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, Volume 1256 of Lecture Notes in Computer Science, pages 582-593, Bologna, Italy, 7-11 July 1997. Springer-Verlag.
18. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57(1): 94-124, August 1998.
19. Thomas A. Henzinger, Peter W. Kopke, and Howard Wong-Toi. The expressive power of clocks. In Zoltán Fülöp and Ferenc Gécseg, editors, Automata, Languages and Programming, 22nd International Colloquium, Volume 944 of Lecture Notes in Computer Science, pages 417-428, Szeged, Hungary, 10-14 July 1995. Springer-Verlag.
20. J. McManis and P. Varaiya. Suspension automata: A decidable class of hybrid automata. In David L. Dill, editor, Proceedings of the si xth International Conference on Computer-Aided Verification CAV, Volume 818 of Lecture Notes in Computer Science, pages 105-117, Standford, California, USA, June 1994. Springer-Verlag.
21. K. J. Kristoffersen, K. G. Larsen, P. Pettersson, and C. Weise. Verification of an experimental batch plant. VHS internal document.
22. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: A class of decidable hybrid systems. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, Hybrid Systems, Volume 736 of Lecture Notes in Computer Science, pages 179-208. Springer-Verlag, 1993.
23. K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of real-time systems: Compact data structure and state-space reduction. In Proc. of the 18th IEEE Real-Time Systems Symposium, RTSS'97. IEEE Computer Society Press, December 1997.
24. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, 1(1/2): 134-152, October 1997.
25. S. Yovine. Kronos: A Verification Tool for real-Time Systems. Journal of Software Tools for Technology Transfer, 1(1/2): 123-133, October 1997.