Modeling concurrency with partial orders
International Journal of Parallel Programming
Safe executions of recognizable trace languages by asynchronous automata
Logic at Botik'89 Symposium on logical foundations of computer science
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Partial commutation and traces
Handbook of formal languages, vol. 3
Asynchronous cellular automata for promsets
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Book of Traces
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On Recognizable Stable Trace Languages
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Theoretical Computer Science - Latin American theoretical informatics
Shared Variables Interaction Diagrams
Proceedings of the 16th IEEE international conference on Automated software engineering
Regular sets of infinite message sequence charts
Information and Computation
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A theory of regular MSC languages
Information and Computation
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Shared-memory systems appear as a generalization of asynchronous cellular automata. In this paper we relate the partial-order semantics of shared-memory systems to Mazurkiewicz trace languages by means of a new refinement construction. We show that a set of labeled partial orders is recognized by some unambiguous shared-memory system if and only if it is definable in monadic second-order logic and media-bounded.