Up-To Techniques for Weighted Systems
From MaRDI portal
Publication:3303913
DOI10.1007/978-3-662-54577-5_31zbMath1452.68100arXiv1701.05001OpenAlexW2601725224MaRDI QIDQ3303913
Filippo Bonchi, Barbara König, Sebastian Küpper
Publication date: 5 August 2020
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.05001
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Related Items
Up-to techniques for behavioural metrics via fibrations, Up-To Techniques for Behavioural Metrics via Fibrations, Bisimulation and coinduction enhancements: a historical perspective, (in)finite trace equivalence of probabilistic transition systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Funayama's theorem revisited
- A coalgebraic perspective on linear weighted automata
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Equational theories of tropical semirings
- Checking NFA equivalence with bisimulations up to congruence
- What’s Decidable about Weighted Automata?
- Weighted Bisimulation in Linear Algebraic Form
- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Antichain Algorithms for Finite Automata
- When Simulation Meets Antichains
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Coinduction up-to in a fibrational setting
- On Shostak's decision procedure for combinations of theories
- Methods and applications of (max,+) linear algebra
- Enhanced coalgebraic bisimulation
- Enhancements of the bisimulation proof method
- Antichains: A New Algorithm for Checking Universality of Finite Automata
