UNAMBIGUOUS SHARED-MEMORY SYSTEMS
From MaRDI portal
Publication:3586410
DOI10.1142/S0129054110007489zbMath1206.68203OpenAlexW1978689244MaRDI QIDQ3586410
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
Related Items (1)
Cites Work
- Asynchronous mappings and asynchronous cellular automata
- Rational \(\omega\)-languages are non-ambiguous
- Modeling concurrency with partial orders
- Petri nets, event structures and domains. I
- Unambiguous Büchi automata.
- Asynchronous cellular automata for pomsets
- Message-passing automata are expressively equivalent to EMSO logic
- A theory of regular MSC languages
- Weak Second‐Order Arithmetic and Finite Automata
- 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
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
- Analysis of Programs for Parallel Processing
This page was built for publication: UNAMBIGUOUS SHARED-MEMORY SYSTEMS
