Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Introduction to algorithms
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Forward and backward simulations I.: untimed systems
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Theoretical Computer Science
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Exact performance equivalence: an equivalence relation for stochastic automata
Theoretical Computer Science
Model checking
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Aggregation Methods for Large Markov Chains
Proceedings of the International Workshop on Computer Performance and Reliability
Automated Performance and Dependability Evaluation Using Model Checking
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
From Pre-Historic to Post-Modern Symbolic Model Checking
Formal Methods in System Design
Optimal state-space lumping in Markov chains
Information Processing Letters
Backward Stochastic Bisimulation in CSL Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Comparative branching-time semantics for Markov chains
Information and Computation
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
| 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. We consider an extension of these results to Markov reward models and Continuous Stochastic Reward Logic. Furthermore, we identify the logical properties for which the requirement on the equality of state-labeling 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.