Specifying real-time properties with metric temporal logic
Real-Time Systems
Journal of the ACM (JACM)
Theoretical Computer Science
The complexity of probabilistic verification
Journal of the ACM (JACM)
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Complexity and real computation
Complexity and real computation
A Laplace transform algorithm for the volume of a convex polytope
Journal of the ACM (JACM)
Membership Questions for Timed and Hybrid Automata
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Model Checking Timed and Stochastic Properties with CSL^{TA}
IEEE Transactions on Software Engineering
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
Performance evaluation and model checking join forces
Communications of the ACM
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Alternating Timed Automata over Bounded Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Convexity recognition of the union of polyhedra
Computational Geometry: Theory and Applications
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Model checking conditional CSL for continuous-time Markov chains
Information Processing Letters
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
Learning and designing stochastic processes from logical constraints
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
From software verification to `everyware' verification
Computer Science - Research and Development
Hi-index | 0.00 |
In this paper we study time-bounded verification of a finite continuous-time Markov chain (CTMC) C against a real-time specification, provided either as a metric temporal logic (MTL) property φ, or as a timed automaton (TA) A. The key question is: what is the probability of the set of timed paths of C that satisfy φ (or are accepted by A) over a time interval of fixed, bounded length? We provide approximation algorithms to solve these problems. We first derive a bound N such that timed paths of C with at most N discrete jumps are sufficient to approximate the desired probability up to ε. Then, for each discrete (untimed) path σ of length at most N, we generate timed constraints over variables determining the residence time of each state along σ, depending on the realtime specification under consideration. The probability of the set of timed paths, determined by the discrete path and the associated timed constraints, can thus be formulated as a multidimensional integral. Summing up all such probabilities yields the result. For MTL, we consider both the continuous and the pointwise semantics. The approximation algorithms differ mainly in constraints generation for the two types of specifications.