Probabilistic weak simulation is decidable in polynomial time

Authors:
Christel Baier;Holger Hermanns;Joost-Pieter Katoen
Affiliations:
Institut für Informatik 1, University of Bonn, Römerstraße 164, D-53117 Bonn, Germany;Department of Computer Science, Saarland University, D-66123 Saarbrücken, Germany;Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Information Processing Letters
Year:
2004

Citing 20
Cited 5

Theory of linear and integer programming

Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Three partition refinement algorithms

SIAM Journal on Computing
Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Communication and concurrency

Communication and concurrency
A probabilistic powerdomain of evaluations

Proceedings of the Fourth Annual Symposium on Logic in computer science
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
A compositional approach to performance modelling

A compositional approach to performance modelling
Modeling and analysis of stochastic systems

Modeling and analysis of stochastic systems
Deciding bisimilarity and similarity for probabilistic processes

Journal of Computer and System Sciences
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Simulation Revisited

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstraction in Probabilistic Process Algebra

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
Simulation for Continuous-Time Markov Chains

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation

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
Weak Bisimulation for Fully Probabilistic Processes

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal state-space lumping in Markov chains

Information Processing Letters

Model checking meets performance evaluation

ACM SIGMETRICS Performance Evaluation Review
Comparative branching-time semantics for Markov chains

Information and Computation
Comparative branching-time semantics for Markov chains

Information and Computation
Flow faster: efficient decision algorithms for probabilistic simulations

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper considers a weak simulation preorder for Markov chains that allows for stuttering. Despite the second-order quantification in its definition, we present a polynomial-time algorithm to compute the weak simulation preorder of a finite Markov chain.