Towards team-automata-driven object-oriented collaborative work

Authors:
Gregor Engels;Luuk Groenewegen
Affiliations:
University of Paderborn, Dept. of Mathematics and Computer Science, 33095 Paderborn, Germany;Leiden University, Dept. of Computer Science, P.O. Box 9512, 2300 RA Leiden, The Netherlands
Venue:
Formal and natural computing
Year:
2002

Citing 9
Cited 1

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Fundamentals of software engineering

Fundamentals of software engineering
SOCCA: Specifications of Coordinated and Cooperative Activities

Software process modelling and technology
Team automata for groupware systems

GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
The Unified Modeling Language user guide

The Unified Modeling Language user guide
Object-oriented modeling: a roadmap

Proceedings of the Conference on The Future of Software Engineering
A methodology for specifying and analyzing consistency of object-oriented behavioral models

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Industrial maintenance modelled in SOCCA: an experience report

ICSP '96 Proceedings of the Fourth International Conference on the Software Process (ICSP '96)
Team automata for spatial access control

ECSCW'01 Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work

A novel approach to modeling context-aware and social collaboration processes

CAiSE'12 Proceedings of the 24th international conference on Advanced Information Systems Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of ...