Symbolic robustness analysis of timed automata

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

Volumn 4202 LNCS, Issue , 2006, Pages 143-155

  Daws, Conrado ^a   Kordy, Piotr ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; INTEGRATED CIRCUITS; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS);

SYMBOLIC ALGORITHMS; SYMBOLIC ROBUSTNESS ANALYSIS; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 33750284875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11867340_11     Document Type: Conference Paper

References (13)

1. K. Altisen and S. Tripakis. Implementation of timed automata: an issue of semantics or modeling? Technical report, Verimag, Centre équation, 38610 Gièes, June 2005.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 1994.
3. J. Bengtsson and W. Yi. Timed automata: Semantics, algorithms and tools. In W. Reisig and G. Rozenberg, editors, In Lecture Notes on Concurrency and Petri Nets, Lecture Notes in Computer Science vol 3098. Springer-Verlag, 2004.
4. P. Bouyer, N. Markey, and P.-A. Reynier. Robust model-checking of linear-time properties in timed automata. In J. R. Correa, A. Hevia, and M. Kiwi, editors, Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LATIN'06), volume 3887 of Lecture Notes in Computer Science, pages 238-249, Valdivia, Chile, Mar. 2006. Springer.
5. C. Daws. Véification de systèes temporisés: de la thérie à a pratique. PhD thesis, Institut National Polytechnique de Grenoble, 20 Oct. 1998.
6. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool Kronos. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science, pages 208-219. Springer-Verlag, 1996.
7. M. De Wulf, L. Doyen, N. Markey, and J.-F. Raskin. Robustness and implementability of timed automata. In Formats - FTRTFT, pages 118-133, 2004.
8. M. De Wulf, L. Doyen, and J. Raskin. Almost ASAP Semantics: from timed models to timed implementations, 2004.
9. V. Gupta, T. Henzinger, and R. Jagadeesan. Robust Timed Automata. In Proc. Int. Work. Hybrid and Real-Time Systems (HART'97), volume 1201 of LNCS, pages 331-345. Springer, 1997.
10. K. Larsen, P. Pettersson, and W Yi. Uppaal in a nutshell. Software Tools for Technology Transfer, 1(1+2): 134-152, 1997.
11. J. Ouaknine and J. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In LICS '03: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, page 198, Washington, DC, USA, 2003. IEEE Computer Society.
12. A. Puri. Dynamical Properties of Timed Automata. In FTRTFT '98: Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 210-227, London, UK, 1998. Springer-Verlag.
13. A. Puri. Dynamical Properties of Timed Automata. Discrete Event Dynamic Systems-Theory and Applications, 10(1-2):87-113, Jan 2000.