CiteSeerX — Model Checking of Probabilistic and Nondeterministic Systems

Model Checking of Probabilistic and Nondeterministic Systems (1995) [141 citations — 13 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Bianco95modelchecking,
    author = {Andrea Bianco and Luca De Alfaro},
    title = {Model Checking of Probabilistic and Nondeterministic Systems},
    booktitle = {},
    year = {1995},
    pages = {499--513},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

. The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. In this paper, we present model-checking algorithms for extensions of pCTL and pCTL* to systems in which the probabilistic behavior coexists with nondeterminism, and show that these algorithms have polynomial-time complexity in the size of the system. This provides a practical tool for reasoning on the reliability and performance of parallel systems. 1 Introduction Temporal logic has been successfully used to specify the behavior of concurrent and reactive systems. These systems are usually modeled as nondeterministic processes: at any moment in time, more than one future evolution may be possible, but a probabilistic characterization of their likelihood is normally not attempted. While ma...

Citations

1313	The Temporal Logic of Reactive and Concurrent Systems – Manna, Pnueli - 1992
987	Theory of linear and integer programming – Schrijver - 1986
897	Temporal and modal logic – Emerson - 1990
242	Automatic verification of finite state concurrent systems using temporal logic specifications: A pratical approach – Clarke, Emerson, et al. - 1983
173	Automatic verification of probabilistic concurrent finite-state programs – Vardi - 1985
137	Time and Probability in Formal Design of Distributed Systems – Hansson - 1994
105	The glory of the past – Lichtenstein, Pnueli, et al. - 1985
66	A logic for reasoning about time and probability – Hansson, Jonsson - 1994
60	Lei: Modalities for Model Checking: Branching Time Strikes Back – Emerson, C-L - 1985
57	It usually works: The temporal logic of stochastic systems – Aziz, Singhal, et al. - 1995
38	Probabilistic verification – Pnueli, Zuck
36	Reasoning with time and chance – Lehmann, Shelah - 1982
30	Verifying Automata Specifications of Probabilistic RealTime Systems – Alur, Courcoubetis, et al.
30	Probabilistic Temporal Logic for Finite and Bounded Models – Hart, Sharir - 1984
29	Verifying Temporal Properties of Finite-State Probabilistic Programs – Courcoubetis, Yannakakis - 1988
21	Branching time logic – Emerson, Srinivasan - 1988
17	On the extremely fair treatment of probabilistic algorithms – Pnueli - 1983
12	Probabilistic verification by tableaux – Pnueli, Zuck - 1986
11	Tight bounds on the complexity of cascaded decomposition of automata – Maler, Pnueli - 1990
10	A framework for reasoning about time and reliability – Hansson, Jonsson - 1989
9	The safety-progress classification – Chang, Manna, et al. - 1992