Polynomial time decision algorithms for probabilistic automata
From MaRDI portal
(Redirected from Publication:498403)
Recommendations
- Deciding probabilistic automata weak bisimulation in polynomial time
- scientific article; zbMATH DE number 1927574
- Deciding Simulations on Probabilistic Automata
- Deciding probabilistic automata weak bisimulation: theory and practice
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- scientific article; zbMATH DE number 1512606 (Why is no real title available?)
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- A testing scenario for probabilistic processes
- An algorithm to solve the proportional network flow problem
- Automated compositional Markov chain generation for a plain-old telephone system
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Branching time and abstraction in bisimulation semantics
- CCS expressions, finite state processes, and three problems of equivalence
- Concurrency and composition in a stochastic world
- Cost preserving bisimulations for probabilistic automata
- Cost preserving bisimulations for probabilistic automata
- Deciding bisimilarity and similarity for probabilistic processes.
- Deciding probabilistic automata weak bisimulation in polynomial time
- Finite state Markovian decision processes
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Interactive Markov chains. And the quest for quantified quality
- Network simplex algorithm for the general equal flow problem.
- On the semantics of Markov automata
- Optimal state-space lumping in Markov chains
- Probability and Nondeterminism in Operational Models of Concurrency
- Sigref – A Symbolic Bisimulation Tool Box
- The many facets of linear programming
- Three Partition Refinement Algorithms
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Cited in
(21)- Branching bisimulation semantics for quantum processes
- A cancellation law for probabilistic processes
- Model independent approach to probabilistic models
- A Space-Efficient Probabilistic Simulation Algorithm
- Deciding probabilistic automata weak bisimulation in polynomial time
- Deciding Simulations on Probabilistic Automata
- Cost preserving bisimulations for probabilistic automata
- Reversibility in process calculi with nondeterminism and probabilities
- An efficient algorithm to determine probabilistic bisimulation
- Deciding probabilistic automata weak bisimulation: theory and practice
- Verifying quantum communication protocols with ground bisimulation
- On divergence-sensitive weak probabilistic bisimilarity
- On well-founded and recursive coalgebras
- The quest for minimal quotients for probabilistic and Markov automata
- A unifying approach to probabilistic testing equivalences
- Deciding bisimilarities on distributions
- Causal reversibility in nondeterministic process calculi extended with time or probabilities
- Pseudodeterministic algorithms and the structure of probabilistic time
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Probabilistic parameterized polynomial time
- scientific article; zbMATH DE number 7559464 (Why is no real title available?)
This page was built for publication: Polynomial time decision algorithms for probabilistic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498403)
