Linear arboreal categories

DOI10.46298/ENTICS.14830MaRDI QIDQ6831457zbMATH OpenFDO

Authors Samson Abramsky, Nihil Shah

Publication date 2 April 2026

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.46298/ENTICS.14830

zbMATH Keywords

categoriescoalgebracomonadfactorisation systemtrace equivalencetransition system

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• Behavioural preorders via graded monads
• Bisimulation from open maps
• Bisimulation invariance and finite models
• Graded monads and behavioural equivalence games
• Homomorphism preservation theorems
• Linear Datalog and Bounded Path Duality of Relational Structures
• Modal logic over finite structures
• Path category for free. Open morphisms from coalgebras with non-deterministic branching
• Relating structure and power: Comonadic semantics for computational resources
• The pebble-relation comonad in finite model theory
• The pebbling comonad in finite model theory

This page was built for publication: Linear arboreal categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831457)