Bisimulation relations for weighted automata

DOI10.1016/j.tcs.2007.11.018zbMath1136.68032OpenAlexW2075690166MaRDI QIDQ2481957

Peter Buchholz

Publication date: 15 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.018

zbMATH Keywords

aggregationequivalencebisimulationfinite automatacongruenceweighted automata

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 (46)

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Weak bisimulations for fuzzy automata ⋮ Compression of finite-state automata through failure transitions ⋮ Backward and forward bisimulation minimization of tree automata ⋮ Combining Model Reductions ⋮ Fuzzy approximations of fuzzy relational structures ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Weighted Bisimulation in Linear Algebraic Form ⋮ Typed Linear Algebra for Weigthed (Probabilistic) Automata ⋮ Unnamed Item ⋮ Simulation relations for pattern matching in directed graphs ⋮ THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA ⋮ Concurrent weighted logic ⋮ Markov chain aggregation and its applications to combinatorial reaction networks ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ A bialgebraic approach to automata and formal language theory ⋮ Fuzzy simulations and bisimulations between fuzzy automata ⋮ A coalgebraic perspective on linear weighted automata ⋮ Lumpability abstractions of rule-based systems ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures ⋮ From generic partition refinement to weighted tree automata minimization ⋮ WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES ⋮ Fragments-based Model Reduction: Some Case Studies ⋮ Labeled fuzzy approximations based on bisimulations ⋮ Polynomial-time algorithms for computing distances of fuzzy transition systems ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Quantitative Kleene coalgebras ⋮ Quantum Physics, Topology, Formal Languages, Computation: A Categorical View as Homage to David Hilbert ⋮ Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm ⋮ Free Energy of Petri Nets ⋮ A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata ⋮ Minimization of Finite State Automata Through Partition Aggregation ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ A Bialgebraic Approach to Automata and Formal Language Theory ⋮ Model checking for a class of weighted automata ⋮ Aggregation-based minimization of finite state automata ⋮ Simulations of Weighted Tree Automata ⋮ Approximate bisimulation relations for fuzzy automata ⋮ Existence and Verification for Decentralized Nondeterministic Discrete-Event Systems Under Bisimulation Equivalence ⋮ Efficient Coalgebraic Partition Refinement ⋮ Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal state-space lumping in Markov chains
• Bisimulation through probabilistic testing
• Exact performance equivalence: An equivalence relation for stochastic automata
• Efficient computation and representation of large reachability sets for composed automata
• Compositional minimisation of finite state systems using interface specifications
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Deciding bisimilarity and similarity for probabilistic processes.
• Bisimulation for labelled Markov processes
• Algebraic laws for nondeterminism and concurrency
• Three Partition Refinement Algorithms
• Finite Continuous Time Markov Chains
• Performance evaluation of (max,+) automata
• A notion of equivalence for stochastic Petri nets
• A Compositional Approach to Performance Modelling
• Iteration 2-theories

This page was built for publication: Bisimulation relations for weighted automata