Mixed product and asynchronous automata
Theoretical Computer Science
Vector controlled concurrent systems. Part I: basic classes
Fundamenta Informaticae
Vector controlled concurrent systems, part II: comparisons
Fundamenta Informaticae
Team automata for groupware systems
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Operational transformation in real-time group editors: issues, algorithms, and achievements
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
Distributed Algorithms
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
Modeling and Enactment of Workflow Systems
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Liveness in Timed and Untimed Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Team automata for spatial access control
ECSCW'01 Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work
A case study on the automated verification of groupware protocols
Proceedings of the 27th international conference on Software engineering
Modularity for teams of I/O automata
Information Processing Letters
Component-interaction automata as a verification-oriented component-based system specification
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Theoretical Computer Science
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Infinite unfair shuffles and associativity
Theoretical Computer Science
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
On the relationship between workflow models and document types
Information Systems
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Open paper: caT: adapting and updating the trellis hypertext model
The New Review of Hypermedia and Multimedia
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling a Secure Agent with Team Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Modularity for teams of I/O automata
Information Processing Letters
A review on specifying software architectures using extended automata-based models
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling behaviour requirements for automatic interpretation, simulation and deployment
SIMPAR'10 Proceedings of the Second international conference on Simulation, modeling, and programming for autonomous robots
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Partition refinement of Component Interaction Automata
Science of Computer Programming
Hi-index | 0.01 |
Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronizeon certain executions of actions.At the conceptual level, our model serves as a formal framework in whichbasic groupware notions can be rigorously defined and studied.At the architectural level, team automata can be used as building blocksin the design of groupware systems.