Quantitative model-checking of one-clock timed automata under probabilistic semantics

Proceedings - 5th International Conference on the Quantitative Evaluation of Systems, QEST 2008

Volumn , Issue , 2008, Pages 55-64

  Bertrand, Nathalie ^a   Bouyer, Patricia ^b   Brihaye, Thomas ^c   Markey, Nicolas ^b  

^a CAMPUS DE BEAULIEU   (France)

^b CNRS   (France)

^c UNIVERSITY OF MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; INFORMATION THEORY; MODEL CHECKING; PROBABILITY; RANDOM PROCESSES; ROBOTS; SEMANTICS; TRANSLATION (LANGUAGES);

CLOSED FORMS; LTL PROPERTIES; PROBABILISTIC SEMANTICS; QUALITATIVE MODELS; QUANTITATIVE MODELS; THRESHOLD PROBLEMS; TIMED AUTOMATONS;

AUTOMATA THEORY;

EID: 56649108183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2008.19     Document Type: Conference Paper

References (19)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. R. Alur, S. La Torre, and P. Madhusudan. Perturbed timed automata. In Proc. 8th International Workshop on Hybrid Systems: Computation and Control (HSCC'05), Lecture Notes in Computer Science 3414, p. 70-85. Springer, 2005.
3. C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer. Almost-sure model checking of infinite paths in one-clock timed automata. In Proc. 23rd Annual Symposium on Logic in Computer Science (LICS'08). IEEE Computer Society Press, 2008. To appear.
4. C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, and M. Größer. Probabilistic and topological semantics for timed automata. In Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), Lecture Notes in Computer Science 4855, p. 179-191. Springer, 2007.
5. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(7):524-541, 2003.
6. D. Berwanger. Admissibility in infinite games. In Proc. 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07), Lecture Notes in Computer Science 4393, p. 188-199. Springer, 2007.
7. P. Bouyer, N. Markey, and P.-A. Reynier. Robust model-checking of timed automata. In Proc. 7th Latin American Symposium on Theoretical Informatics (LATIN'06), Lecture Notes in Computer Science 3887, p. 238-249. Springer, 2006.
8. P. Bouyer, N. Markey, and P.-A. Reynier. Robust analysis of timed automata via channel machines. In Proc. 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Lecture Notes in Computer Science 4962, p. 157-171. Springer, 2008.
9. P. Brémaud. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer, 1999.
10. K. Chatterjee. Concurrent games with tail objectives. Theoretical Computer Science, 388(1-3):181-198, 2007.
11. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
12. M. De Wulf, L. Doyen, N. Markey, and J.-F. Raskin. Robustness and implementability of timed automata. In Proc. Joint Conference on Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS+FTRTFT'04), Lecture Notes in Computer Science 3253, p. 118-133. Springer, 2004.
13. M. De Wulf, L. Doyen, and J.-F. Raskin. Almost ASAP semantics: From timed models to timed implementations. In Proc. 7th International Workshop on Hybrid Systems: Computation and Control (HSCC'04), Lecture Notes in Computer Science 2993, p. 296-310. Springer, 2004.
14. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. Logical Methods in Computer Science, 2006.
15. V. Gupta, Th. A. Henzinger, and R. Jagadeesan. Robust timed automata. In Proc. International Workshop on Hybrid and Real-Time Systems (HART'97), Lecture Notes in Computer Science 1201, p. 331-345. Springer, 1997.
16. Th. A. Henzinger and J.-F. Raskin. Robust undecidability of timed and hybrid systems. In Proc. 3rd International Workshop on Hybrid Systems: Computation and Control (HSCC'00), Lecture Notes in Computer Science 1790, p. 145-159. Springer, 2000.
17. E. Kopczynski. Omega-regular half-positional winning conditions. In Proc. 21th International Workshop on Computer Science Logic (CSL'07), Lecture Notes in Computer Science 4646, p. 41-53. Springer, 2007.
18. A. Pnueli. The temporal logic of programs. In Proc. 18th Annual Symposium on Foundations of Computer Science (FoCS'77), p. 46-57. IEEE Computer Society Press, 1977.
19. A. Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP'03), Lecture Notes in Computer Science 2719, p. 1008-1021. Springer, 2003.