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.
This research was supported in part by the National Science Foundation under grant CCR-92-23226, by the Advanced Research Projects Agency under NASA grant NAG2-892, by the United States Air Force Office of Scientific Research under grant F49620-93-1-0139, by Department of the Army under grant DAAH04-95-1-0317, and by the Italian National Research Council.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, and D. Dill. Verifying automata specifications of probabilistic real-time systems. In Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 28–44. Springer-Verlag, 1992.
A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Computer Aided Verification, 7th International Workshop, volume 939 of Lect. Notes in Comp. Sci. Springer-Verlag, 1995.
E. Chang, Z. Manna, and A. Pnueli. The safety-progress classification. In Logic, Algebra, and Computation, NATO ASI Series, Subseries F: Computer and System Sciences. Springer-Verlag, Berlin, 1992.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic. In Proc. 10th ACM Symp. Princ. of Prog. Lang., 1983.
C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proc. 29th IEEE Symp. Found. of Comp. Sci., 1988.
E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume E, chapter 16, pages 995–1072. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
E.A. Emerson and C.L. Lei. Modalities for model checking: Branching time strikes back. In Proc. 12th ACM Symp. Princ. of Prog. Lang., pages 84–96, 1985.
E.A. Emerson and A.P. Sistla. Deciding branching time logic. In Proc. 16th ACM Symp. Theory of Comp., pages 14–24, 1984.
H. Hansson. Time and Probabilities in Formal Design of Distributed Systems. Real-Time Safety Critical Systems. Elsevier, 1994.
H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proc. of Real Time Systems Symposium, pages 102–111. IEEE, 1989.
H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512–535, 1994.
S. Hart and M. Sharir. Probabilistic temporal logic for finite and bounded models. In Proc. 16th ACM Symp. Theory of Comp., pages 1–13, 1984.
J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
D. Lehman and S. Shelah. Reasoning with time and chance. Information and Control, 53(3):165–198, 1982.
O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proc. Conf. Logics of Programs, volume 193 of Lect. Notes in Comp. Sci., pages 196–218. Springer-Verlag, 1985.
O. Maler and A. Pnueli. Tight bounds on the complexity of cascaded decomposition of automata. In Proc. 31th IEEE Symp. Found. of Comp. Sci., pages 672–682, 1990.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
A. Pnueli. On the extremely fair treatment of probabilistic algorithms. In Proc. 15th ACM Symp. Theory of Comp., pages 278–290, 1983.
A. Pnueli and L. Zuck. Probabilistic verification by tableaux. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 322–331, 1986.
A. Pnueli and L.D. Zuck. Probabilistic verification. Information and Computation, 103:1–29, 1993.
A. Schrijver. Theory of Linear and Integer Programming. J. Wiley & Sons, 1987.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. 26th IEEE Symp. Found. of Comp. Sci., pages 327–338, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianco, A., de Alfaro, L. (1995). Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_70
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive