An Ordered Category of Processes

DOI10.1007/978-3-540-78913-0_27zbMath1140.68049OpenAlexW2171445608MaRDI QIDQ3498427

Michael Winter

Publication date: 15 May 2008

Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_27

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Preorders, orders, domains and lattices (viewed as categories) (18B35) Categories of spans/cospans, relations, or partial maps (18B10)

Related Items (3)

Using relation-algebraic means and tool support for investigating and computing bipartitions ⋮ Relational properties of sequential composition of coalgebras ⋮ Embedding mappings and splittings with applications

Cites Work

• Squares and rectangles in relation categories. Three cases: Semilattice, distributive lattice and Boolean non-unitary
• A relation algebraic approach to interaction categories
• NOTES ON THE UNIVERSALITY OF RELATIONAL FUNCTORS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Ordered Category of Processes