A Space-Efficient Probabilistic Simulation Algorithm
From MaRDI portal
Recommendations
- A space-efficient simulation algorithm on probabilistic automata
- Deciding Simulations on Probabilistic Automata
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- An efficient algorithm to determine probabilistic bisimulation
- Polynomial time decision algorithms for probabilistic automata
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- Correcting a Space-Efficient Simulation Algorithm
- Deciding bisimilarity and similarity for probabilistic processes.
- Deciding Simulations on Probabilistic Automata
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- From bisimulation to simulation: Coarsest partition problems
- scientific article; zbMATH DE number 1614700 (Why is no real title available?)
- scientific article; zbMATH DE number 1705168 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177519 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Three Partition Refinement Algorithms
Cited in
(5)- A space-efficient simulation algorithm on probabilistic automata
- An algorithm for probabilistic alternating simulation
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
This page was built for publication: A Space-Efficient Probabilistic Simulation Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541022)