In this talk I argue that, contrary to what is widely believed, process graphs, or labelled transition systems, have enough structure to model non-interleaved features of concurrency. Moreover a non-interleaved process graph semantics of the system description language CCSP (a combination of CCS and CSP) is provided, using Plotkin's structural operational approach. Furthermore, criteria for semantic equivalences for concurrent systems are proposed and evaluated.
|Number of pages||2|
|Publication status||Published - 1 Mar 1988|
|Event||GMD-Workshop 1988 - Königswinter, Germany|
Duration: 1 Mar 1988 → 1 Mar 1988
|Period||1/03/88 → 1/03/88|