Quantitative simulations by matrices
From MaRDI portal
Publication:729815
DOI10.1016/j.ic.2016.03.007zbMath1355.68197arXiv1810.09146OpenAlexW2182724168MaRDI QIDQ729815
Publication date: 22 December 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.09146
Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulations for fuzzy automata
- Maximal traces and path-based coalgebraic temporal logics
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Simulations in coalgebra
- A new polynomial-time algorithm for linear programming
- Handbook of weighted automata
- Probable innocence revisited
- Probabilistic anonymity via coalgebraic simulations
- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
- Probabilistic weak simulation is decidable in polynomial time
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Undecidable problems for probabilistic automata of fixed dimension
- Forward and backward simulations. I. Untimed Systems
- Algorithmic probabilistic game semantics. Playing games with automata
- Trace semantics via determinization
- Weighted automata and weighted logics
- Bisimulations for weighted automata over an additively idempotent semiring
- A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
- Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
- TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
- A Coalgebraic Perspective on Minimization and Determinization
- Quantitative languages
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Coalgebraic Trace Semantics via Forgetful Logics
- On the average number of steps of the simplex method of linear programming
- Weighted Bisimulation in Linear Algebraic Form
- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Nominal Kleene Coalgebra
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Generic Forward and Backward Simulations II: Probabilistic Simulation
- Beyond Bisimulation: The “up-to” Techniques
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Coinduction up-to in a fibrational setting
- A final coalgebra theorem
- The equality problem for rational series with multiplicities in the tropical semiring is undecidable
- Coalgebraic Infinite Traces and Kleisli Simulations
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Generic Trace Semantics via Coinduction
- Algebra and Coalgebra in Computer Science
- Automata, Languages and Programming
- Generic Forward and Backward Simulations
This page was built for publication: Quantitative simulations by matrices
