The paper argues that CSP's STOP process can be defined as STOP = μ X. nil → X, where nil is a new unobservable event.
A Comparative Introduction to CSP, CCS and LOTOS
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Implicit Recursive Characteristics of STOP
The paper argues that CSP's STOP process can be defined as STOP = μ X. nil → X, where nil is a new unobservable event.