Probabilistic and topological semantics for timed automata

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

Volumn 4855 LNCS, Issue , 2007, Pages 179-191

  Baier, Christel ^a   Bertrand, Nathalie ^a   Bouyer, Patricia ^b,c   Brihaye, Thomas ^b   Größer, Marcus ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b CNRS   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MODEL CHECKING; PROBABILISTIC LOGICS; PROBLEM SOLVING; TOPOLOGY;

FINITE EXECUTIONS; TOPOLOGICAL SEMANTICS;

SEMANTICS;

EID: 38349014207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_15     Document Type: Conference Paper

References (17)

1. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for probabilistic real-time systems. In: Leach Albert, J., Monien, B., Rodriguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 115-126. Springer, Heidelberg (1991)
2. Alur, R., Courcoubetis, C., Dill, D.: Verifying automata specifications of probabilistic real-time systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) Real-Time: Theory in Practice. LNCS, vol. 600, pp. 28-44. Springer, Heidelberg (1992)
3. Alur, R., Dill, D.: A theory of timed automata. Theoretical Comp. Sci. 126(2), 183-235 (1994)
4. Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 70-85. Springer, Heidelberg (2005)
5. Baier, C., Bertrand, N., Bouyer, P., Brihaye, Th., Größer, M.: Probabilistic and topological semantics for timed automata. Research Report LSV-07-26, LSV, ENS de Cachan, France (2007)
6. Bouyer, P., Markey, N., Reynier, P.-A.: Robust model-checking of timed automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 238-249. Springer, Heidelberg (2006)
7. De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 118-133. Springer, Heidelberg (2004)
8. De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 296-310. Springer, Heidelberg (2004)
9. Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 331-345. Springer, Heidelberg (1997)
10. Henzinger, Th.A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Transactions on Computational Logic 6(1), 1-32 (2005)
11. Henzinger, Th.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 145-159. Springer, Heidelberg (2000)
12. Munkres, J.R.: Topology, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)
13. Oxtoby, J.C.: The Banach-Mazur game and Banach category theorem. Annals of Mathematical Studies 39, 159-163 (1957)
14. Pnueli, A.: The temporal logic of programs. In: Proc. 18th Ann. Symp. Foundations of Computer Science (FOCS 1977), pp. 46-57. IEEE Comp. Soc. Press, Los Alamitos (1977)
15. Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 210-227. Springer, Heidelberg (1998)
16. Sproston, J.: Model checking for probabilistic timed systems. In: Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 189-229. Springer, Heidelberg (2004)
17. Varacca, D., Völzer, H.: Temporal logics and model checking for fairly correct systems. In: Varacca, D. (ed.) Proc. 21st Ann. Symp. Logic in Computer Science (LICS 2006), pp. 389-398. IEEE Comp. Soc. Press, Los Alamitos (2006)