Three partition refinement algorithms
SIAM Journal on Computing
Bisimulation through probabilistic testing
Information and Computation
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Communication and Concurrency
Fundamental Results for the Verification of Observational Equivalence: A Survey
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
A Semantics Based Verification Tool for Finite State Systems
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Simulation as Coarsest Partition Problem
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Model checking meets performance evaluation
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Interactive Markov chains (IMCs) are compositional performance evaluation models which can be used to powerfully model concurrent systems. Simulations that are abstracted from internal computation have been proven to be useful for verification of compositely defined transition system. In the literature of stochastic extension of this transition system, computing simulation preorders are rare. In this paper strong(weak) simulation is introduced for IMCs. The main result of the paper is that we give algorithms to decide strong(weak) simulation preorder for IMCs with a polynomial-time complexity in the number of states of the transition system.