Mixed product and asynchronous automata
Theoretical Computer Science
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Free shuffle algebras in language varieties
Theoretical Computer Science
Team automata for groupware systems
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Mappings of languages by two-tape devices
Journal of the ACM (JACM)
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Complexity of expressions allowing concurrency
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Synchronized Shuffle and Regular Languages
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Fair and Associative Infinite Trajectories
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Input/Output Compatibility of Reactive Systems
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Formal Security Analysis with Interacting State Machines
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Alternative Semantics for Temporal Logics
Alternative Semantics for Temporal Logics
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Theoretical Computer Science
Infinite unfair shuffles and associativity
Theoretical Computer Science
Software Descriptions with Flow Expressions
IEEE Transactions on Software Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
Component composition preserving behavioural contracts based on communication traces
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Fundamenta Informaticae
Hi-index | 0.00 |
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrenceswhich preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a different word, may be identified as a single occurrence. In case at least one of the words involved is infinite, a (synchronized) shuffle can also be unfair in the sense that an infinite word may prevail fromsome point onwards even when the other word still has occurrences to contribute to the shuffle. We prove that for the synchronized shuffle operations under consideration, every (fair or unfair) synchronized shuffle can be obtained as a limit of synchronized shuffles of the finite prefixes of the words involved. In addition, it is shown that with the exception of one, all synchronized shuffle operations that we consider satisfy a natural notion of associativity, also in case of unfairness. Finally, using these results, some compositionality results for team automata are established.