Abstract
In this paper the branching time logic pCTL* is defined. pCTL* expresses quantitative bounds on the probabilities of correct behavior; it can be interpreted over discrete Markov processes. A bisimulation relation is defined on finite Markov processes, and shown to be sound and complete with respect to pCTL*. We extend the universe of models to generalized Markov processes in order to support notions of refinement, abstraction, and parametrization. Model checking pCTL* over generalized Markov processes is shown to be elementary by a reduction to RCF. We conclude by describing practical and theoretical avenues for further work.
Supported by SRC Grant 94-DC-008 and NSF/DARPA Grant MIP-8719546
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, and D. Dill. Model Checking for Probabilistic Real Time Systems. In Proc. of the Colloquium on Automata, Languages, and Programming, pages 115–126, 1991.
A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. Sangiovanni-Vincentelli. It Usually Works: The Temporal Logic of Stochastic Systems. http://www-cad.eecs.berkeley.edu:80/ãdnan/cav95.1.
A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Equivalences for Fair Kripke Structures. In International Colloquium on Automata, Languages and Programming. Springer Verlag, July 1994.
R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. In Proc. Intl. Conf. on Computer-Aided Design, pages 188–192, 1993.
M. Ben-Or, D. Kozen, and J. Reif. The Complexity of Elementary Algebra and Geometry. In Proc. ACM Symposium on the Theory of Computing, pages 457–464, 1984.
M. C. Browne, E. M. Clarke, and O. Grümberg. Characterizing Kripke Structures in Temporal Logic. Technical Report CMU-CS-87-104, Department of Computer Science, Carnegie Mellon University, 1987.
R. Cleavland, S. A. Smolka, and A. Zwarico. Testing Preorders for Probabilistic Processes. In Proc. of the Colloquium on Automata, Languages, and Programming, pages 708–719, 1992.
C. Courcoubetis and M. Yannakakis. Verifying Temporal Properties of Finite State Probabilistic Programs. In Proc. IEEE Symposium on the Foundations of Computer Science, pages 338–345, 1988.
C. Courcoubetis and M. Yannakakis. Automatic Verification of Finite State Programs. In Proc. of the Colloquium on Automata, Languages, and Programming, pages 326–347, 1990.
E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 996–1072. Elsevier Science, 1990.
Ioannis Emiris. Sparse Elimination and Applications in Kinematics. PhD thesis, University of California at Berkeley, Berkeley, CA, December 1994.
H. Hansson and B. Jonsson. A Logic for Reasoning about Time and Reliability. Formal Aspects of Computing, 6:512–535, 1994.
S. Hart and M. Shamir. Probabilistic Temporal Logics for Finite and Bounded Models. In Proc. ACM Symposium on the Theory of Computing, pages 1–13, 1984.
S. Hart, M. Sharir, and A. Pneuli. Verification of Probabilistic Programs. SIAM Journal of Computation, 13:292–314, 1984.
A. Paz. Introduction to Probabilistic Automata. Academic-Press, 1971.
A. Pnueli and L. Zuck. Probabilistic verification. Information and Computation, 103(1):1–29, 1993.
Ashutosh Rege. Efficient Decision Procedures for Fragments of R.C.F. (in preparation). PhD thesis, University of California at Berkeley, Berkeley, CA, June 1995.
D. Revuz. Markov Chains. North-Holland, 1975.
H. L. Royden. Real Analysis. Macmillan Publishing, 1889.
M. Y. Vardi and P. L. Wolper. An Automata-Theoretic Approach to Program Verification. In Proc. IEEE Symposium on Logic in Computer Science, pages 332–334, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aziz, A., Singhal, V., Balarin, F., Brayton, R.K., Sangiovanni-Vincentelli, A.L. (1995). It usually works: The temporal logic of stochastic systems. In: Wolper, P. (eds) Computer Aided Verification. CAV 1995. Lecture Notes in Computer Science, vol 939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60045-0_48
Download citation
DOI: https://doi.org/10.1007/3-540-60045-0_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60045-9
Online ISBN: 978-3-540-49413-3
eBook Packages: Springer Book Archive