Shared-memory systems and charts

Authors:
Rémi Morin
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille, LIF, CNRS, UMR 6166 and Aix-Marseille Université, Marseille, France
Venue:
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Year:
2011

Citing 14
Cited 0

On recognizable subsets of free partially commutative monoids

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Representation of computations in concurrent automata by dependence orders

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
Partial commutation and traces

Handbook of formal languages, vol. 3
Asynchronous cellular automata for promsets

Theoretical Computer Science
The Book of Traces

The Book of Traces
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Model Checking of Message Sequence Charts

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Unambiguous Büchi automata

Theoretical Computer Science - Latin American theoretical informatics
Infinite-state high-level MSCs: Model-checking and realizability

Journal of Computer and System Sciences
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend several results from Mazurkiewicz trace theory to the framework of cut-bounded languages. First the expressive power of shared-memory systems in terms of recognized sets of labeled partial orders is characterized by means of the notion of cutbound plus the condition to be regular, or equivalently MSO-definable. Next weakly unambiguous systems with deterministic rules are proved to be as expressive as any system, contrary to deterministic or strongly unambiguous systems considered previously. Finally we extend the rational description of regular trace languages by loop-connected specifications within a new algebraic framework called shared-memory charts. In that way we present also several generalizations of results from the theory of regular sets of message sequence charts.