It usually works: The temporal logic of stochastic systems [chapter]

Adnan Aziz, Vigyan Singhal, Felice Balarin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
1995 Lecture Notes in Computer Science  
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
more » ... cesses is shown to be elementary by a reduction to RCF. We conclude by describing practical and theoretical avenues for further work.
doi:10.1007/3-540-60045-0_48 fatcat:jgytbviwxrcidphjfnioy6atse