Behavioural equivalences for coalgebras with unobservable moves

DOI10.1016/J.JLAMP.2015.09.002MaRDI QIDQ890618zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

process calculicoalgebraic semanticssaturation semanticsweak behavioural equivalences

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• On coalgebras with internal moves
• Towards weak bisimulation for coalgebras
• Coalgebraic Weak Bisimulation from Recursive Equations over Monads
• Weak bisimulation for coalgebras over order enriched monads
• On path-based coalgebras and weak notions of bisimulation

Cites work

• scientific article; zbMATH DE number 3929909 (Why is no real title available?)
• scientific article; zbMATH DE number 3756452 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3463628 (Why is no real title available?)
• scientific article; zbMATH DE number 2172972 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 3397722 (Why is no real title available?)
• scientific article; zbMATH DE number 7333244 (Why is no real title available?)
• A categorical model of the fusion calculus
• A coalgebraic view of \(\varepsilon \)-transitions
• A final coalgebra theorem
• About permutation algebras, (pre)sheaves and named sets
• Algebra-coalgebra duality in Brzozowski's minimization algorithm
• Bisimulation for labelled Markov processes
• Coalgebraic Weak Bisimulation from Recursive Equations over Monads
• Coalgebraic logic for stochastic right coalgebras
• Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
• Coalgebraic trace semantics for continuous probabilistic transition systems
• Coalgebraic weak bisimulation for action-type systems
• Complete iterativity for algebras with effects
• Distributing probability over non-determinism
• Generalizing determinization from automata to coalgebras
• Generic Forward and Backward Simulations
• Generic Trace Semantics via Coinduction
• Introduction to bisimulation and coinduction
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• Labelled Markov processes.
• Lifting theorems for Kleisli categories
• Modal logic and the Vietoris functor
• Morita contexts as lax functors
• Nominal sets. Names and symmetry in computer science
• Probabilistic systems coalgebraically: a survey
• Relating coalgebraic notions of bisimulation
• Resource bisimilarity and graded bisimilarity coincide
• Strong functors and monoidal monads
• Structural operational semantics for continuous state stochastic transition systems
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Structural operational semantics for stochastic and weighted transition systems
• The category theoretic understanding of universal algebra: Lawvere theories and monads
• Towards weak bisimulation for coalgebras
• Universal coalgebra: A theory of systems
• Weak Bisimulations for the Giry Monad (Extended Abstract)
• Weak bisimulation for coalgebras over order enriched monads

Cited in

(10)

• A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
• Behavioural equivalences for timed systems
• scientific article; zbMATH DE number 7471684 (Why is no real title available?)
• Characterising behavioural equivalence: Three sides of one coin
• On coalgebras with internal moves
• Coalgebraic infinite traces and Kleisli simulations
• scientific article; zbMATH DE number 7407787 (Why is no real title available?)
• 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)