Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

DOI10.1007/S10703-012-0147-3MaRDI QIDQ453545zbMATH OpenOpenAlexFDO

Authors 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

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Probabilistic bisimulation and simulation algorithms by abstract interpretation
• An efficient algorithm to determine probabilistic bisimulation
• Deciding bisimilarity and similarity for probabilistic processes.
• scientific article; zbMATH DE number 1927574
• Exploring probabilistic bisimulations. I

Cites work

• scientific article; zbMATH DE number 1306878 (Why is no real title available?)
• scientific article; zbMATH DE number 1834576 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• A Space-Efficient Probabilistic Simulation Algorithm
• An efficient simulation algorithm based on abstract interpretation
• Bisimulation for labelled Markov processes
• Bisimulation through probabilistic testing
• Constructive versions of Tarski's fixed point theorems
• Deciding bisimilarity and similarity for probabilistic processes.
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Generalized Strong Preservation by Abstract Interpretation
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Probabilistic bisimulation and simulation algorithms by abstract interpretation
• Refining and compressing abstract domains
• Three Partition Refinement Algorithms

Cited in

(13)

• Simulation for lattice-valued doubly labeled transition systems
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Simulation and Bisimulation for Probabilistic Timed Automata
• An efficient algorithm to determine probabilistic bisimulation
• An algorithm for probabilistic alternating simulation
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• A space-efficient simulation algorithm on probabilistic automata
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• scientific article; zbMATH DE number 5173926 (Why is no real title available?)
• Probabilistic bisimulation and simulation algorithms by abstract interpretation
• Logical characterizations of behavioral relations on transition systems of probability distributions
• scientific article; zbMATH DE number 1512606 (Why is no real title available?)

This page was built for publication: Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453545)