A new polynomial-time algorithm for linear programming
Combinatorica
Three partition refinement algorithms
SIAM Journal on Computing
Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Process algebra for performance evaluation
Theoretical Computer Science
Communication and Concurrency
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Probabilistic Logical Characterization
Information and Computation
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Branching cells as local states for event structures and nets: probabilistic applications
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
An algorithm for probabilistic alternating simulation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Computing game metrics on markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Abstract Probabilistic Automata
Information and Computation
Hi-index | 0.00 |
We propose decision algorithms for bisimulation relations defined on probabilistic automata, a model for concurrent nondeterministic systems with randomization. The algorithms decide both strong and weak bisimulation relations based on deterministic as well as randomized schedulers. These algorithms extend and complete other known algorithms for simpler relations and models. The algorithm we present for strong probabilistic bisimulation has polynomial time complexity, while the algorithm for weak probabilistic bisimulation is exponential; however we argue that the latter is feasible in practice.