Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation

DOI10.1007/978-3-642-22012-8_23zbMath1333.68196MaRDI QIDQ3012928

Silvia Crafa, Francesco Ranzato

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_23

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, Computing Behavioral Relations for Probabilistic Concurrent Systems, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, A Spectrum of Behavioral Relations over LTSs on Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Deciding bisimilarity and similarity for probabilistic processes.
• Generalized Strong Preservation by Abstract Interpretation
• A Space-Efficient Probabilistic Simulation Algorithm
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Three Partition Refinement Algorithms
• Systematic design of program transformation frameworks by abstract interpretation
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems