A complete logic for behavioural equivalence in coalgebras of finitary set functors
From MaRDI portal
Publication:1683709
DOI10.1016/j.jlamp.2017.05.001zbMath1382.68155OpenAlexW2613196302MaRDI QIDQ1683709
Publication date: 1 December 2017
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01446025/file/418352_1_En_10_Chapter.pdf
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30) Special properties of functors (faithful, full, etc.) (18A22)
Cites Work
- A coalgebraic perspective on linear weighted automata
- Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
- Origins of the cohomology of groups
- Recursion and corecursion have the same equational logic
- Universal coalgebra: A theory of systems
- Terminal coalgebras and free iterative theories
- Non-Deterministic Kleene Coalgebras
- On the Final Coalgebra of Automatic Sequences
- A Complete Logical System for the Equality of Recursive Terms for Sets
- On Finitary Functors and Their Presentations
- Automatic Sequences and Zip-Specifications
- Presentation of Set Functors: A Coalgebraic Perspective
- A Kleene Theorem for Polynomial Coalgebras
- The logic of recursive equations
- Monoid-labeled transition systems
- A final coalgebra theorem
- Enhanced coalgebraic bisimulation
- A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
