71 search results - page 1 / 15 » A Calculus for Team Automata |
ENTCS
2008
13 years 4 months ago
2008
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
FM
2003
Springer
13 years 10 months ago
2003
Springer
A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation...
GROUP
1997
ACM
13 years 9 months ago
1997
ACM
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 autom...
ECSCW
2001
13 years 6 months ago
2001
Abstract. Team automata provide a framework for capturing notions like coordination, colon, and cooperation in distributed systems. They consist of an abstract specification of com...
ILC
2007
Springer
13 years 11 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...