Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

DOI10.1007/S10703-012-0147-3zbMATH Open1290.68093OpenAlexW2145454356MaRDI QIDQ453545FDOQ453545

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

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

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)

Cites Work

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

Cited In (12)

• Simulation for lattice-valued doubly labeled transition systems
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Simulation and Bisimulation for Probabilistic Timed Automata
• Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions
• An efficient algorithm to determine probabilistic bisimulation
• Title not available (Why is that?)
• A space-efficient simulation algorithm on probabilistic automata
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Title not available (Why is that?)
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Probabilistic bisimulation and simulation algorithms by abstract interpretation
• Title not available (Why is that?)

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)