Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Quantitative Model Checking of Systems with Degradation
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We focus on systems that naturally incorporate a degrading quality, such as electronic devices with degrading electric charge or broadcasting networks with decreasing power or quality of a transmitted signal. For such systems, we introduce an extension of linear temporal logic with quantitative constraints (Linear Temporal Logic with Degradation Constraints, or DLTL for short) that provides a user-friendly formalism for specifying properties involving quantitative requirements on the level of degradation. The syntax of DLTL resembles syntax of Metric Interval Temporal Logic (MITL) designed for reasoning about timed systems. Thus, we investigate their relation and a possibility of translating DLTL verification problem for systems with degradation into previously solved MITL verification problem for timed automata. We show, that through the mentioned translation, the DLTL model checking problem can be solved with limited, yet arbitrary, precision. Further, we show that probability in Markov Decision Processes can be viewed as a degrading quality and DLTL as a probabilistic linear temporal logic with quantitative operators. We discuss expressiveness of DLTL as compared with expressiveness of probabilistic temporal logics.