Congruences and Bisimulations for Continuous-Time Stochastic Logic
Continuous stochastic logic (CSL) deals with the verification of systems operating in continuous time, it may be traced to the well known tree logic CTL. We propose a probabilistic interpretation of this logic that is based on stochastic relations without making specific assumptions on the underlying distribution, and study the problem of bisimulations in a fairly general context from the viewpoint of congruences for stochastic relations. The goal is finding minimal sets of formulas that permit efficient checking of models.
Unable to display preview. Download preview PDF.
- 5.Doberkat, E.-E.: Stochastic relations: congruences, bisimulations and the Hennessy-Milner theorem. SIAM J. Computing (2005) (in print)Google Scholar
- 6.Doberkat, E.-E.: Zeno paths, congruences and bisimulations for continuous-time stochastic logic. Technical Report 155, Chair for Software Technology, University of Dortmund (March 2005)Google Scholar