Unambiguous shared-memory systems

DOI10.1142/S0129054110007489MaRDI QIDQ3586410zbMATH OpenOpenAlexFDO

Authors Rémi Morin

Publication date 6 September 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054110007489

zbMATH Keywords

asynchronous cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• MSO Logic for Unambiguous Shared-Memory Systems
• Shared-memory systems and charts
• Semantics of Deterministic Shared-Memory Systems
• scientific article; zbMATH DE number 4112050
• Multitraces, hypertraces and partial order semantics

Cites work

• A theory of regular MSC languages
• An extension of the notions of traces and of asynchronous automata
• Analysis of Programs for Parallel Processing
• Asynchronous cellular automata for pomsets
• Asynchronous mappings and asynchronous cellular automata
• 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
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Time, clocks, and the ordering of events in a distributed system
• Unambiguous Büchi automata.
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(3)

• Shared-memory systems and charts
• MSO Logic for Unambiguous Shared-Memory Systems
• Semantics of Deterministic Shared-Memory Systems

This page was built for publication: Unambiguous shared-memory systems

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