A logic for reasoning about time and reliability
Formal Aspects of Computing1994Vol. 6(5), pp. 512–535
Citations Over TimeTop 10% of 1994 papers
Abstract
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 the Markov chain. A simple example is included to illustrate the algorithms.
Related Papers
- → Fundamental relations in simple and 0-simple semihypergroups of small size(2012)8 cited
- → New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces(2008)6 cited
- → Simple endotrivial modules for quasi-simple groups(2013)3 cited
- The [0-Simple] Simple Subsemigroups of Nonnegative Matrices(2000)
- → Book Review: IV. Pastorial — Practical Studies: Simple Sermons for Times like These, Simple Sermons on Evangelistic Themes, Simple Talks for Christian Workers, Simple Sermons on Prophetic Themes, Simple Sermons about Jesus Christ, Simple Sermons on Heaven, Hell, and Judgment, Simple Sermons on the Ten Commandments, Simple Sermons for a Sinful Age, Simple Sermons on the Seven Churches of Revelation(1975)