A relation algebraic approach to interaction categories

DOI10.1016/S0020-0255(99)00021-3zbMath0938.18006OpenAlexW2040172312MaRDI QIDQ1961872

Michael Winter

Publication date: 21 June 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00021-3

zbMATH Keywords

synchronization treesinteraction categoriesconcurrent system specificationsstrongly guarded functorstime-extended allegoriesunitary division allegory

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (1)

An Ordered Category of Processes

Cites Work

• Relation algebraic domain constructions
• Squares and rectangles in relation categories. Three cases: Semilattice, distributive lattice and Boolean non-unitary
• Relational Methods in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A relation algebraic approach to interaction categories