DMCA
A Logic for Reasoning about Time and Reliability (1994)
| Venue: | Formal Aspects of Computing |
| Citations: | 370 - 1 self |
BibTeX
@ARTICLE{Hansson94alogic,
author = {Hans Hansson and Bengt Jonsson},
title = {A Logic for Reasoning about Time and Reliability},
journal = {Formal Aspects of Computing},
year = {1994},
volume = {6},
pages = {102--111}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satisfies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and This research report is a revised and extended version of a paper that has appeared under the title "A Framework for Reasoning about Time and Reliability" in the Proceeding of the 10 th IEEE Real-time Systems Symposium, Santa Monica CA, December 1989. This work was partially supported by the Swedish Board for Technical Development (STU) as part of Esprit BRA Project SPEC, and by the Swedish Telecommunication Administration. the Markov chain. A simple example is inc...
Keyphrases
markov chain swedish telecommunication administration research report polynomial number temporal logic ctl extended version swedish board th ieee real-time system symposium discrete time markov chain technical development santa monica ca esprit bra project spec arithmetic operation simple example
