Deciding probabilistic automata weak bisimulation: theory and practice
DOI10.1007/S00165-016-0356-4zbMATH Open1335.68117OpenAlexW2302717412MaRDI QIDQ282105FDOQ282105
Authors: Luis María Ferrer Fioriti, Vahid Hashemi, Holger Hermanns, Andrea Turrini 
Publication date: 12 May 2016
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-016-0356-4
Recommendations
linear programmingefficiencycomplexityprobabilistic automataconcurrencycompositional analysissatisfiability modulo theoriesweak bisimulation
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
- Title not available (Why is that?)
- Three Partition Refinement Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decomposition algorithm to determine the maximum flow in a generalized network
- Network simplex algorithm for the general equal flow problem.
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- Compositional minimisation of finite state systems using interface specifications
- Automated compositional Markov chain generation for a plain-old telephone system
- An algorithm to solve the proportional network flow problem
- Finite state Markovian decision processes
- The multiplicative weights update method: a meta-algorithm and applications
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Concurrency and composition in a stochastic world
- The Efficiency of the Simplex Method: A Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Programming in O([n3/ln n]L) Operations
- Title not available (Why is that?)
- Polynomial time decision algorithms for probabilistic automata
- The quest for minimal quotients for probabilistic automata
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Probability and Nondeterminism in Operational Models of Concurrency
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Exact algorithms for linear programming over algebraic extensions
- CCS expressions, finite state processes, and three problems of equivalence
Cited In (9)
- Deciding Simulations on Probabilistic Automata
- Deciding probabilistic automata weak bisimulation in polynomial time
- Title not available (Why is that?)
- 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
Uses Software
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)
