Behavioural equivalences for coalgebras with unobservable moves
From MaRDI portal
Publication:890618
DOI10.1016/j.jlamp.2015.09.002zbMath1330.68195arXiv1411.0090OpenAlexW2121722880MaRDI QIDQ890618
Tomasz Brengos, Marino Miculan, Marco Peressotti
Publication date: 10 November 2015
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0090
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)
Related Items (8)
Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Structural operational semantics for non-deterministic processes with quantitative aspects ⋮ A general account of coinduction up-to ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural operational semantics for stochastic and weighted transition systems
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Probabilistic systems coalgebraically: a survey
- About permutation algebras, (pre)sheaves and named sets
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- Coalgebraic logic for stochastic right coalgebras
- Universal coalgebra: A theory of systems
- Resource bisimilarity and graded bisimilarity coincide
- Morita contexts as lax functors
- Structural operational semantics for continuous state stochastic transition systems
- Bisimulation for labelled Markov processes
- Strong functors and monoidal monads
- Towards Weak Bisimulation For Coalgebras
- A Coalgebraic View of ε-Transitions
- Nominal Sets
- The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
- Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
- Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
- Complete Iterativity for Algebras with Effects
- Weak bisimulation for coalgebras over order enriched monads
- Relating coalgebraic notions of bisimulation
- Introduction to Bisimulation and Coinduction
- Weak Bisimulations for the Giry Monad (Extended Abstract)
- Generalizing determinization from automata to coalgebras
- A final coalgebra theorem
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Modal Logic and the Vietoris Functor
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- A Categorical Model of the Fusion Calculus
- Generic Trace Semantics via Coinduction
- Distributing probability over non-determinism
- Generic Forward and Backward Simulations
- Lifting theorems for Kleisli categories
This page was built for publication: Behavioural equivalences for coalgebras with unobservable moves
