Behavioural equivalences for coalgebras with unobservable moves
From MaRDI portal
Publication:890618
DOI10.1016/J.JLAMP.2015.09.002zbMATH Open1330.68195arXiv1411.0090OpenAlexW2121722880MaRDI QIDQ890618FDOQ890618
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)
Abstract: We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose hom-sets are endowed with complete orders and a suitable iteration operators; this structure allows us to provide the abstract definitions of various (weak) behavioural equivalence. We show that the Kleisli categories of many common monads are categories of this kind. This allows us to readily instantiate the abstract definitions to a wide range of existing systems (weighted LTS, Segala systems, calculi with names, etc.), recovering the corresponding notions of weak behavioural equivalences. Moreover, we can provide neatly new weak behavioural equivalences for more complex behaviours, like those definable on topological spaces, measurable spaces, etc.
Full work available at URL: https://arxiv.org/abs/1411.0090
Recommendations
Categorical semantics of formal languages (18C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Universal coalgebra: A theory of systems
- Bisimulation for labelled Markov processes
- Nominal sets. Names and symmetry in computer science
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Relating coalgebraic notions of bisimulation
- Title not available (Why is that?)
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- A Categorical Model of the Fusion Calculus
- Generic Trace Semantics via Coinduction
- Generic Forward and Backward Simulations
- Lifting theorems for Kleisli categories
- Title not available (Why is that?)
- A final coalgebra theorem
- Probabilistic systems coalgebraically: a survey
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Labelled Markov processes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributing probability over non-determinism
- Strong functors and monoidal monads
- Title not available (Why is that?)
- About permutation algebras, (pre)sheaves and named sets
- Introduction to Bisimulation and Coinduction
- Structural operational semantics for stochastic and weighted transition systems
- Structural operational semantics for continuous state stochastic transition systems
- Title not available (Why is that?)
- Complete Iterativity for Algebras with Effects
- Title not available (Why is that?)
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- Weak bisimulation for coalgebras over order enriched monads
- Title not available (Why is that?)
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- Towards weak bisimulation for coalgebras
- Coalgebraic logic for stochastic right coalgebras
- Generalizing determinization from automata to coalgebras
- Title not available (Why is that?)
- Coalgebraic trace semantics for continuous probabilistic transition systems
- Resource bisimilarity and graded bisimilarity coincide
- Morita contexts as lax functors
- A Coalgebraic View of ε-Transitions
- Weak Bisimulations for the Giry Monad (Extended Abstract)
- Modal Logic and the Vietoris Functor
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- A general account of coinduction up-to
This page was built for publication: Behavioural equivalences for coalgebras with unobservable moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890618)
