MSO Logic for Unambiguous Shared-Memory Systems

DOI10.1007/978-3-540-85780-8_41MaRDI QIDQ3533037zbMATH OpenOpenAlexFDO

Authors Rémi Morin

Publication date 30 October 2008

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85780-8_41

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Unambiguous shared-memory systems
• Semantics of Deterministic Shared-Memory Systems
• Parameterized Memory Models and Concurrent Separation Logic
• A unified theory of shared memory consistency
• A denotational semantics for shared-memory parallelism and nondeterminism
• An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
• On bounded reachability analysis of shared memory systems
• scientific article; zbMATH DE number 1830911

Cites work

• scientific article; zbMATH DE number 1701359 (Why is no real title available?)
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• scientific article; zbMATH DE number 1305000 (Why is no real title available?)
• scientific article; zbMATH DE number 1512617 (Why is no real title available?)
• A theory of regular MSC languages
• An extension of the notions of traces and of asynchronous automata
• Asynchronous cellular automata for pomsets
• Asynchronous mappings and asynchronous cellular automata
• Mathematical Foundations of Computer Science 2005
• Message-passing automata are expressively equivalent to EMSO logic
• Modeling concurrency with partial orders
• Notes on finite asynchronous automata
• Petri nets, event structures and domains. I
• Rational \(\omega\)-languages are non-ambiguous
• Regular sets of infinite message sequence charts
• Representation of computations in concurrent automata by dependence orders
• Semantics of Deterministic Shared-Memory Systems
• Time, clocks, and the ordering of events in a distributed system
• Unambiguous Büchi automata.

Cited in

(3)

• Shared-memory systems and charts
• Unambiguous shared-memory systems
• Semantics of Deterministic Shared-Memory Systems

This page was built for publication: MSO Logic for Unambiguous Shared-Memory Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533037)