Semantics of Deterministic Shared-Memory Systems
From MaRDI portal
Publication:3541010
DOI10.1007/978-3-540-85361-9_7zbMath1160.68471MaRDI QIDQ3541010
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_7
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous mappings and asynchronous cellular automata
- Modeling concurrency with partial orders
- Mixed product and asynchronous automata
- Petri nets, event structures and domains. I
- Asynchronous cellular automata for pomsets
- Regular sets of infinite message sequence charts
- A theory of regular MSC languages
- MSO Logic for Unambiguous Shared-Memory Systems
- Notes on finite asynchronous automata
- An extension of the notions of traces and of asynchronous automata
- Time, clocks, and the ordering of events in a distributed system
- Mathematical Foundations of Computer Science 2005