Author:
Brázdil Tomáš,Krčál Jan,Křetínský Jan,Kučera Antonín,Řehák Vojtěch
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;R. Alur,1991
2. Lecture Notes in Computer Science;R. Alur,1992
3. Alur, R., Dill, D.: A theory of timed automata. TCS 126(2), 183–235 (1994)
4. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Größer, M.: Almost-sure model checking of infinite paths in one-clock timed automata. In: Proceedings of LICS 2008, pp. 217–226. IEEE, Los Alamitos (2008)
5. Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. TCS 345, 2–26 (2005)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Control Synthesis for Cyber-Physical Systems to Satisfy Metric Interval Temporal Logic Objectives under Timing and Actuator Attacks;2020 ACM/IEEE 11th International Conference on Cyber-Physical Systems (ICCPS);2020-04
2. Verification and Control of Turn-Based Probabilistic Real-Time Games;The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy;2019
3. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration;2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS);2016-09
4. Expected reachability-time games;Theoretical Computer Science;2016-06
5. The Value of Attack-Defence Diagrams;Lecture Notes in Computer Science;2016