On the expressive power of CCS

DOI10.1007/3-540-60692-0_57zbMath1354.68194OpenAlexW1598923566MaRDI QIDQ2956692

Bard Bloom, Ashvin Dsouza

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_57

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Bisimilarity is not finitely based over BPA with interrupt ⋮ Coupled similarity: the first 32 years ⋮ On the axiomatisability of priority

This page was built for publication: On the expressive power of CCS