Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303)

This paper studies relationships between operational semantics based on Hennessy \& Plotkin-style transition systems, and denotational semantics based on notions from metric topology, for three simple languages with concurrency. The first has shuffle and a straightforward type of nondeterminism, the second includes synchronization, and the third contains synchronization and a more refined notion of nondeterminism. The languages are all uniform in the sense that elementary actions remain uninterpreted. Infinitary linear (streams) and tree-like (processes in the sense of De Bakker \& Zucker) structures are employed to model infinite behaviour. In the (nontrivial) comparison of the denotational and operational models we also encounter a ready set model in the sense of Hoare \& Olderog.