Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions
From MaRDI portal
Publication:2946748
DOI10.1145/2641566zbMath1354.68192OpenAlexW1989849430MaRDI QIDQ2946748
Silvia Crafa, Francesco Ranzato
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/2961100
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Probabilistic logical characterization
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Exploring probabilistic bisimulations. I
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions
- Characterising Testing Preorders for Finite Probabilistic Processes
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Characterising Probabilistic Processes Logically
- Systematic design of program transformation frameworks by abstract interpretation
- Abstract Interpretation Frameworks
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
This page was built for publication: Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions