Modeling concurrency with partial orders
International Journal of Parallel Programming
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Mixed product and asynchronous automata
Theoretical Computer Science
Asynchronous mappings and asynchronous cellular automata
Information and Computation
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
Deterministic Behavioural Models for Concurrency
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Concurrency, Automata and Domains
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Safe Executions of Recognizable Trace Languages by Asynchronous Automata
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Shared Variables Interaction Diagrams
Proceedings of the 16th IEEE international conference on Automated software engineering
Categories of asynchronous systems
Categories of asynchronous systems
Regular sets of infinite message sequence charts
Information and Computation
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
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Shared-memory systems and charts
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 0.01 |
We investigate a general model of concurrency for shared-memory systems. We introduce some intuitive interleaving semantics within the general framework of automata with concurrency relations and connect it to some partial order approach. Then our main result identifies the expressive power of finite deterministic shared-memory systems with the notion of regular consistent sets of labeled partial orders. We characterize also by means of a coherence property the languages recognized by deadlock-free systems.