A Calculus of Communicating Systems¶
Milner, R. (1980). A Calculus of Communicating Systems. Springer-Verlag.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Equivalence Relation
- … $P$ and $Q$ are bisimilar if every transition $P \to P'$ can be matched by a transition $Q \to Q'$ such that $P'$ and $Q'$ are again bisimilar (and symmetrically), and the bisimilarity relation partitions processes into observational-equivalence classes that are the canonical objects of process-algebra reasoning.
This sourceOriginating treatment of CCS; the bisimulation equivalence relation introduced here is the canonical observational-equivalence relation on processes, underwriting process-algebra verification. Cited in prose (Computer Science, Notes) on bisimulation as the canonical equivalence on processes; no FACT marker.
- … $P$ and $Q$ are bisimilar if every transition $P \to P'$ can be matched by a transition $Q \to Q'$ such that $P'$ and $Q'$ are again bisimilar (and symmetrically), and the bisimilarity relation partitions processes into observational-equivalence classes that are the canonical objects of process-algebra reasoning.
Domain-specific¶
- Calculus of Communicating Systems
- The resulting labelled transition system is the process's behavior, and bisimulation supplies the central step-for-step standard for asking whether two process descriptions behave alike.
This sourceLecture Notes in Computer Science 92. Springer, 1980. <https://doi.org/10.1007/3-540-10235-3>
- The resulting labelled transition system is the process's behavior, and bisimulation supplies the central step-for-step standard for asking whether two process descriptions behave alike.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:f9388ac6f74a · see in the full table