Weighted Bisimulation in Linear Algebraic Form

DOI10.1007/978-3-642-04081-8_12MaRDI QIDQ3184672zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bisimulations for weighted automata over an additively idempotent semiring
• Bisimulation relations for weighted automata
• A coalgebraic perspective on linear weighted automata
• Bisimulation Minimisation for Weighted Tree Automata
• Bisimulation metrics for weighted automata

Cites work

• A calculus of communicating systems
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Bisimulation relations for weighted automata
• Bisimulation through probabilistic testing
• Characterising Testing Preorders for Finite Probabilistic Processes
• Composition and behaviors of probabilistic I/O automata
• Deciding bisimilarity and similarity for probabilistic processes.
• Exact performance equivalence: An equivalence relation for stochastic automata
• scientific article; zbMATH DE number 3709587 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 2040325 (Why is no real title available?)
• scientific article; zbMATH DE number 2040327 (Why is no real title available?)
• scientific article; zbMATH DE number 195202 (Why is no real title available?)
• scientific article; zbMATH DE number 1884420 (Why is no real title available?)
• Noncommutative minimization algorithms
• On the definition of a family of automata
• Probabilistic I/O Automata: Theories of Two Equivalences
• Rational streams coalgebraically
• Testing equivalences for processes

Cited in

(24)

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

This page was built for publication: Weighted Bisimulation in Linear Algebraic Form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184672)