17 search results - page 1 / 4 » Team Automata Satisfying Compositionality |
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...
IRI
2008
IEEE
13 years 11 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical model...
ENTCS
2008
13 years 5 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...
JALC
2006
13 years 5 months ago
2006
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...