Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
Abstract elided by the publisher.
Related papers
- Bisimulation Through Probabilistic Testing POPL 1989
- Environmental bisimulations for probabilistic higher-order languages POPL 2016
- Environmental Bisimulations for Probabilistic Higher-order Languages TOPLAS 2019
- Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains CAV 2025
- Bisimulation Proof Methods in a Path-Based Specification Language for Polynomial Coalgebras APLAS 2010
- Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis ESOP 2001
- Scalar Outcomes Suffice for Finitary Probabilistic Testing ESOP 2007
- Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata CAV 2013