scientific article; zbMATH DE number 7471684
From MaRDI portal
Publication:5028446
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1902.02601
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coalgebrabisimulationlogiclabelled transition systemBüchi automatasaturationmonadweak bisimulationinternal transitionepsilon transitioninfinite traceBuechi automatatau transition
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic systems coalgebraically: a survey
- Results on the propositional \(\mu\)-calculus
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- Behavioural equivalences for coalgebras with unobservable moves
- Completeness of Park induction
- Universal coalgebra: A theory of systems
- Automata, logics, and infinite games. A guide to current research
- Deciding bisimilarity and similarity for probabilistic processes.
- Strong functors and monoidal monads
- A Coalgebraic View of ε-Transitions
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Stream Automata Are Coalgebras
- Trace Semantics via Determinization
- Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
- Corecursive Algebras, Corecursive Monads and Bloom Monads
- Weak bisimulation for coalgebras over order enriched monads
- On Coalgebras with Internal Moves
- A Survey of Graphical Languages for Monoidal Categories
- A Unifying Kleene Theorem for Weighted Finite Automata
- Introduction to Bisimulation and Coinduction
- EXPTIME Tableaux for the Coalgebraic mu-Calculus
- Monad compositions II: Kleisli strength
- Automata for Coalgebras: An Approach Using Predicate Liftings
- Iteration Grove Theories with Applications
- A uniform framework for timed automata
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Coalgebraic Infinite Traces and Kleisli Simulations
- An Invitation to Applied Category Theory
- Probabilistic ω-automata
- Generic Trace Semantics via Coinduction
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Generic Forward and Backward Simulations
- Automata theory and its applications
This page was built for publication: