A logic for reasoning about time and reliability
Formal Aspects of Computing · 1994-09 · 6 (5) · 512-535
DOI: 10.1007/bf01211866 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Aspects of Computing, 1994-09. Verfasst von Hans Hansson und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1038-mal zitiert (Crossref) und nennt 56 Literaturangaben.
Abstract (Originalsprache)
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 the Markov chain. A simple example is included to illustrate the algorithms.
Zitieren
APA
Hansson, H., & Jonsson, B. (1994). A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5), 512-535. https://doi.org/10.1007/bf01211866
Vancouver
Hansson H, Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing. 1994;6(5):512-535. doi:10.1007/bf01211866
BibTeX
@article{Hansson1994,
author = {Hansson, Hans and Jonsson, Bengt},
title = {A logic for reasoning about time and reliability},
journal = {Formal Aspects of Computing},
year = {1994},
volume = {6},
number = {5},
pages = {512--535},
doi = {10.1007/bf01211866}
}
EUVIMED