A Space-Efficient Probabilistic Simulation Algorithm
From MaRDI portal
Publication:3541022
DOI10.1007/978-3-540-85361-9_22zbMath1160.68432OpenAlexW25577671MaRDI QIDQ3541022
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_22
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
An Algorithm for Probabilistic Alternating Simulation ⋮ A space-efficient simulation algorithm on probabilistic automata ⋮ Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation ⋮ Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
Cites Work
- From bisimulation to simulation: Coarsest partition problems
- Deciding bisimilarity and similarity for probabilistic processes.
- Deciding Simulations on Probabilistic Automata
- Correcting a Space-Efficient Simulation Algorithm
- Three Partition Refinement Algorithms
- A Fast Parametric Maximum Flow Algorithm and Applications
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Space-Efficient Probabilistic Simulation Algorithm
