Weighted Bisimulation in Linear Algebraic Form

DOI10.1007/978-3-642-04081-8_12zbMath1254.68130OpenAlexW1555534061MaRDI QIDQ3184672

Michele Boreale

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Coalgebras for Bisimulation of Weighted Automata over Semirings, Morphisms and Minimisation of Weighted Automata, Concurrent weighted logic, Comparing chemical reaction networks: a categorical and algorithmic perspective, Singular value automata and approximate minimization, A coalgebraic perspective on linear weighted automata, Learning weighted automata over principal ideal domains, Weighted Automata over Vector Spaces, Algebra, Coalgebra, and Minimization in Polynomial Differential Equations, Up-To Techniques for Weighted Systems, Quantitative Kleene coalgebras, Automata Learning: A Categorical Perspective, Quantitative simulations by matrices, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, (in)finite trace equivalence of probabilistic transition systems, Automatic pre- and postconditions for partial differential equations, On the Coalgebra of Partial Differential Equations, Bisimulation metrics and norms for real-weighted automata, Trace semantics via determinization

Cites Work

• Noncommutative minimization algorithms
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Exact performance equivalence: An equivalence relation for stochastic automata
• Testing equivalences for processes
• Composition and behaviors of probabilistic I/O automata
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Deciding bisimilarity and similarity for probabilistic processes.
• Bisimulation relations for weighted automata
• On the definition of a family of automata
• Rational streams coalgebraically
• Characterising Testing Preorders for Finite Probabilistic Processes
• Probabilistic I/O Automata: Theories of Two Equivalences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item