Infinite unfair shuffles and associativity-Reference-Cited by-同舟云学术

Infinite unfair shuffles and associativity

Published:2007-06 Issue:3 Volume:380 Page:401-410
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

ter Beek Maurice H.,Kleijn Jetty

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. K. Abrahamson, Decidability and Expresiveness of Logics of Processes, Ph.D. Thesis, University of Washington, Seattle, 1980

2. Component composition preserving behavioural contracts based on communication traces;Bailly,2006

3. M.H. ter Beek, Team Automata — A Formal Approach to the Modeling of Collaboration Between System Components, Ph.D. Thesis, Leiden Institute of Advanced Computer Science, Leiden University, 2003

4. Synchronizations in team automata for groupware systems;ter~Beek;Computer Supported Cooperative Work—The Journal of Collaborative Computing,2003

5. Team automata satisfying compositionality;ter~Beek,2003

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Behavioural separation with parallel usages;Proceedings of the 23rd ACM International Workshop on Formal Techniques for Java-like Programs;2021-07-11

2. Context-Free Grammars for Deterministic Regular Expressions with Interleaving;Theoretical Aspects of Computing – ICTAC 2019;2019

3. Learning Concise Relax NG Schemas Supporting Interleaving from XML Documents;Advanced Data Mining and Applications;2018

4. Associativity of Infinite Synchronized Shuffles and Team Automata;Fundamenta Informaticae;2009