Theoretical Computer Science
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Temporal Logics and Model Checking for Fairly Correct Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Reachability in Stochastic Timed Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Quantitative robustness analysis of flat timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Untimed language preservation in timed systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Statistical model checking for networks of priced timed automata
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Playing optimally on timed automata with random delays
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
A maximal entropy stochastic process for a timed automaton,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Transient analysis of networks of stochastic timed automata using stochastic state classes
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
Like most models used in model-checking, timed automata are an idealized mathematical model used for representing systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely (sequences of) events. We propose two new semantics for the satisfaction of LTL formulas, one based on probabilities, and the other one based on topology, to rule out these sequences. We prove that the two semantics are equivalent and lead to a PSPACE-Complete model-checking problem for LTL over finite executions.