Comparative branching-time semantics for Markov chains
Information and Computation
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Bisimulation relations for weighted automata
Theoretical Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
Lumpability abstractions of rule-based systems
Theoretical Computer Science
| Hi-index | 0.00 |
Equivalence relations can be used to reduce the state space of a system model, thereby permitting more efficient analysis. We study backward stochastic bisimulation in the context of model checking continuous-time Markov chains against Continuous Stochastic Logic (CSL) properties. While there are simple CSL properties that are not preserved when reducing the state space of a continuous-time Markov chain using backward stochastic bisimulation, we show that the equivalence can nevertheless be used in the verification of a practically significant class of CSL properties. Furthermore, we identify the logical properties for which the requirement on the equality of state-labelling sets (normally imposed on state equivalences in a model-checking context) can be omitted from the definition of the equivalence, resulting in a better state-space reduction.