Convenient category of processes and simulations I: Modulo strong bisimilarity

DOI10.1007/3-540-60164-3_17zbMath1502.68194OpenAlexW1511705245MaRDI QIDQ5057463

Dusko Pavlovic

Publication date: 16 December 2022

Published in: Category Theory and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60164-3_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Cites Work

• Algebra of communicating processes with abstraction
• Bisimulation of automata
• Terminal coalgebras in well-founded set theory
• A final coalgebra theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convenient category of processes and simulations I: Modulo strong bisimilarity