MSO Logic for Unambiguous Shared-Memory Systems
From MaRDI portal
Publication:3533037
DOI10.1007/978-3-540-85780-8_41zbMath1159.68025OpenAlexW2151712167MaRDI QIDQ3533037
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
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asynchronous mappings and asynchronous cellular automata
- Rational \(\omega\)-languages are non-ambiguous
- Modeling concurrency with partial orders
- Petri nets, event structures and domains. I
- Representation of computations in concurrent automata by dependence orders
- Unambiguous Büchi automata.
- Asynchronous cellular automata for pomsets
- Regular sets of infinite message sequence charts
- Message-passing automata are expressively equivalent to EMSO logic
- A theory of regular MSC languages
- Semantics of Deterministic 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: MSO Logic for Unambiguous Shared-Memory Systems
