Efficient Algorithms for Verification of Equivalences for Probabilistic Processes
No abstract available.
Related papers
- Efficient Probabilistic Model Checking for Relational Reachability CAV 2025
- Bisimulation Through Probabilistic Testing POPL 1989
- Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols) CAV 2019
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems POPL 2015
- On Probabilistic Parallel Programs with Process Creation and Synchronisation TACAS 2011
- \mathsf StocHy : Automated Verification and Synthesis of Stochastic Processes TACAS 2019
- Scalar Outcomes Suffice for Finitary Probabilistic Testing ESOP 2007