Deciding probabilistic automata weak bisimulation: theory and practice
type: Item
instance of: scholarly article
title: Deciding probabilistic automata weak bisimulation: theory and practice
zbMATH Open document ID: 1335.68117
author: Luis María Ferrer Fioriti
author: Vahid Hashemi
author: Holger Hermanns
author: Andrea Turrini
published in: Formal Aspects of Computing
publication date: 2016-05-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6579512
zbMATH Keywords: complexity
zbMATH Keywords: compositional analysis
zbMATH Keywords: concurrency
zbMATH Keywords: efficiency
zbMATH Keywords: linear programming
zbMATH Keywords: probabilistic automata
zbMATH Keywords: satisfiability modulo theories
zbMATH Keywords: weak bisimulation
describes a project that uses: lp_solve
describes a project that uses: z3
describes a project that uses: PRISM
describes a project that uses: SMT-LIB
describes a project that uses: GLPK
MaRDI profile type: MaRDI publication profile
full work available at URL: s00165-016-0356-4
OpenAlex ID: W2302717412
cites work: The multiplicative weights update method: a meta-algorithm and applications
cites work: Q3056948
cites work: Linear Programming in O([n3/ln n]L) Operations
cites work: Exact algorithms for linear programming over algebraic extensions
cites work: A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Network simplex algorithm for the general equal flow problem.
cites work: Towards Performance Prediction of Compositional Models in Industrial GALS Designs
cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
cites work: Q4847023
cites work: Q4484499
cites work: Finite state Markovian decision processes
cites work: The Quest for Minimal Quotients for Probabilistic Automata
cites work: Concurrency and Composition in a Stochastic World
cites work: Three Partition Refinement Algorithms
cites work: Computing Behavioral Relations for Probabilistic Concurrent Systems
cites work: Compositional minimisation of finite state systems using interface specifications
cites work: A decomposition algorithm to determine the maximum flow in a generalized network
cites work: Q4845364
cites work: Automated compositional Markov chain generation for a plain-old telephone system
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: Q3889331
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4197641
cites work: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
cites work: Q4051879
cites work: Q4518898
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Q3992568
cites work: An algorithm to solve the proportional network flow problem
cites work: Q4536612
cites work: Q4738778
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Probability and Nondeterminism in Operational Models of Concurrency
cites work: The Efficiency of the Simplex Method: A Survey
cites work: Polynomial time decision algorithms for probabilistic automata
DOI: 10.1007/S00165-016-0356-4
description: scientific article; zbMATH DE number 6579512