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.
机构:
Univ of California, Los Angeles,, Computer Science Dep, Los Angeles,, CA, USA, Univ of California, Los Angeles, Computer Science Dep, Los Angeles, CA, USAUniv of California, Los Angeles,, Computer Science Dep, Los Angeles,, CA, USA, Univ of California, Los Angeles, Computer Science Dep, Los Angeles, CA, USA