Deciding probabilistic automata weak bisimulation: theory and practice

DOI10.1007/s00165-016-0356-4zbMath1335.68117OpenAlexW2302717412MaRDI QIDQ282105

Vahid Hashemi, Andrea Turrini, Holger Hermanns, Luis María Ferrer Fioriti

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

zbMATH Keywords

complexitylinear programmingefficiencyconcurrencyprobabilistic automatacompositional analysissatisfiability modulo theoriesweak bisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

On divergence-sensitive weak probabilistic bisimilarity ⋮ Approximate bisimulation relations for fuzzy automata

Uses Software

• PRISM
• lp_solve
• SMT-LIB
• GLPK
• z3

Cites Work

• Polynomial time decision algorithms for probabilistic automata
• A new polynomial-time algorithm for linear programming
• CCS expressions, finite state processes, and three problems of equivalence
• 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
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• 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
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• Concurrency and Composition in a Stochastic World
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• The Efficiency of the Simplex Method: A Survey
• Three Partition Refinement Algorithms
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Linear Programming in O([n3/ln nL) Operations]
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding probabilistic automata weak bisimulation: theory and practice