Polynomial time decision algorithms for probabilistic automata
DOI10.1016/J.IC.2015.07.004zbMATH Open1329.68168OpenAlexW1037179907MaRDI QIDQ498403FDOQ498403
Andrea Turrini, Holger Hermanns
Publication date: 28 September 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.07.004
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
probabilistic automatalinear programming problembranching probabilistic bisimulationbranching probabilistic simulationpolynomial decision algorithmweak probabilistic bisimulationweak probabilistic simulation
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Sigref – A Symbolic Bisimulation Tool Box
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
- Title not available (Why is that?)
- Interactive Markov chains. And the quest for quantified quality
- Three Partition Refinement Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network simplex algorithm for the general equal flow problem.
- Automated compositional Markov chain generation for a plain-old telephone system
- Deciding bisimilarity and similarity for probabilistic processes.
- An algorithm to solve the proportional network flow problem
- Finite state Markovian decision processes
- Concurrency and Composition in a Stochastic World
- Title not available (Why is that?)
- Probability and Nondeterminism in Operational Models of Concurrency
- CCS expressions, finite state processes, and three problems of equivalence
- Branching time and abstraction in bisimulation semantics
- Optimal state-space lumping in Markov chains
- The many facets of linear programming
- A testing scenario for probabilistic processes
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
- On the Semantics of Markov Automata
- Title not available (Why is that?)
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Cost Preserving Bisimulations for Probabilistic Automata
- Cost Preserving Bisimulations for Probabilistic Automata
Cited In (14)
- Branching bisimulation semantics for quantum processes
- Model independent approach to probabilistic models
- A Space-Efficient Probabilistic Simulation Algorithm
- Deciding Simulations on Probabilistic Automata
- 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
- Pseudodeterministic algorithms and the structure of probabilistic time
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Probabilistic parameterized polynomial time
- Title not available (Why is that?)
Uses Software
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)
