CSP, partial automata, and coalgebras.

DOI10.1016/S0304-3975(01)00019-6zbMath1050.68099MaRDI QIDQ1603814

U. E. Wolter

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Communicating sequential processesCoalgebrasFinal automataPartial automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum, Processes as formal power series: a coinductive approach to denotational semantics

Cites Work

• Universal coalgebra: A theory of systems
• The Category-Theoretic Solution of Recursive Domain Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item