CONCUR 2008 - Concurrency Theory

Volume 5201 of the series Lecture Notes in Computer Science pp 36-51

Semantics of Deterministic Shared-Memory Systems

  • Rémi MorinAffiliated withLaboratoire d’Informatique Fondamentale de Marseille, Aix-Marseille université — UMR 6166 — CNRS

* Final gross prices may vary according to local VAT.

Get Access


We investigate a general model of concurrency for shared-memory systems. We introduce some intuitive interleaving semantics within the general framework of automata with concurrency relations and connect it to some partial order approach. Then our main result identifies the expressive power of finite deterministic shared-memory systems with the notion of regular consistent sets of labeled partial orders. We characterize also by means of a coherence property the languages recognized by deadlock-free systems.