PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Ter Beek M. H., Martin-Vide C., Mitrana V. Synchronized Shuffles. The document has been submitted to Conference FOSSACS 2004: Foundations of Software Science and Computation Structures, Technical report, 2003.
 
 
Abstract
(English)
We introduce and investigate three synchronized shuffle operations on words and languages. We show how such operations come into play when proving compositionality of automata-based specification models, by demonstrating their usage in the context of team automata. As far as the mathematical properties of these operations are concerned, we prove that in a trio the closure under shuffle is equivalent to the closure under any of the synchronized shuffles studied in this paper. Finally, based on this result, we present an algorithm for deciding whether or not a given regular language is synchronized shuffle closed.
Subject Synchronization
Shuffle operations
Closure properties
D.2.4 Software/Program Verification . Formal methods
F.4.3 Formal Languages . Operations on languages


Icona documento 1) Download Document PS


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional