Semantics of Deterministic Shared-Memory Systems

DOI10.1007/978-3-540-85361-9_7zbMath1160.68471OpenAlexW1508621757MaRDI QIDQ3541010

Rémi Morin

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

MSO Logic for Unambiguous Shared-Memory Systems ⋮ Shared-Memory Systems and Charts

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

This page was built for publication: Semantics of Deterministic Shared-Memory Systems