Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

DOI10.1007/s10703-012-0147-3zbMath1290.68093OpenAlexW2145454356MaRDI QIDQ453545

Silvia Crafa, Francesco Ranzato

Publication date: 27 September 2012

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-012-0147-3

zbMATH Keywords

abstract interpretationprobabilistic bisimulation equivalenceprobabilistic LTSprobabilistic simulation preordersimulation algorithm

Mathematics Subject Classification ID

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

A space-efficient simulation algorithm on probabilistic automata, An efficient algorithm to determine probabilistic bisimulation, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient simulation algorithm based on abstract interpretation
• Bisimulation through probabilistic testing
• Constructive versions of Tarski's fixed point theorems
• Deciding bisimilarity and similarity for probabilistic processes.
• Bisimulation for labelled Markov processes
• Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
• Generalized Strong Preservation by Abstract Interpretation
• A Space-Efficient Probabilistic Simulation Algorithm
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Three Partition Refinement Algorithms
• Refining and compressing abstract domains
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems