Generalized Synchronization Languages

Authors:
Isabelle Ryl;Yves Roos;Mireille Clerbout
Affiliations:
-;-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 7
Cited 0

2-asynchronous automata (Note)

Theoretical Computer Science
Models for concurrency: towards a classification

Theoretical Computer Science
The difference between splitting in n and n + 1

Information and Computation
Partial commutation and traces

Handbook of formal languages, vol. 3
Synchronization expressions with extended join operation

Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
The Book of Traces

The Book of Traces
About Synchronization Languages

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generalized synchronization languages are a model used to describe the behaviors of distributed applications whose synchronization constraints are expressed by generalized synchronization expressions -- an extension of synchronization expressions. Generalized synchronization languages were conjectured by Salomaa and Yu to be characterized by a semi-commutation. We show that this semi-commutation characterizes the images of generalized synchronization languages by a morphism-like class of rational functions.