Deciding probabilistic automata weak bisimulation: theory and practice
From MaRDI portal
(Redirected from Publication:282105)
Recommendations
Cites work
- scientific article; zbMATH DE number 3695547 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- scientific article; zbMATH DE number 1538043 (Why is no real title available?)
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- scientific article; zbMATH DE number 795215 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- A decomposition algorithm to determine the maximum flow in a generalized network
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- A new polynomial-time algorithm for linear programming
- An algorithm to solve the proportional network flow problem
- Automated compositional Markov chain generation for a plain-old telephone system
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- CCS expressions, finite state processes, and three problems of equivalence
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Compositional minimisation of finite state systems using interface specifications
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Concurrency and composition in a stochastic world
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Exact algorithms for linear programming over algebraic extensions
- Finite state Markovian decision processes
- Linear Programming in O([n3/ln n]L) Operations
- Network flows. Theory, algorithms, and applications.
- Network simplex algorithm for the general equal flow problem.
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Polynomial time decision algorithms for probabilistic automata
- Probability and Nondeterminism in Operational Models of Concurrency
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- The Efficiency of the Simplex Method: A Survey
- The multiplicative weights update method: a meta-algorithm and applications
- The quest for minimal quotients for probabilistic automata
- Three Partition Refinement Algorithms
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Cited in
(9)- Deciding probabilistic automata weak bisimulation in polynomial time
- Deciding Simulations on Probabilistic Automata
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- Polynomial time decision algorithms for probabilistic automata
- On divergence-sensitive weak probabilistic bisimilarity
- Probabilistic weak simulation is decidable in polynomial time
- Weak bisimulation for probabilistic timed automata
- Approximate bisimulation relations for fuzzy automata
- The quest for minimal quotients for probabilistic automata
This page was built for publication: Deciding probabilistic automata weak bisimulation: theory and practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282105)
