PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Ter Beek M. H., Kleijn J. Team automata satysfying compositionality. In: FME 2003: Formal methods. International Symposium of Formal Methods (Pisa, Italy, September 2003). Proceedings, pp. 381 - 400. Keijiro Araki, Stefania Gnesi, Dino Mandrioli (eds.). (Lecture Notes in Computer Science, vol. 2805). Springer, 2003.
 
 
Abstract
(English)
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 of the conditions under which team automata satisfy compositionality, we study their computations and behaviour in relation to those of their constituting component automata. We show that the construction of team automata according to certain natural types of synchronization guarantees compositionality.
Subject computation automata
D.2.1 Requirements/Specifications. Methodologies (e.g., object-oriented, structured)
F.1.1 Models of Computation. Automata (e.g., finite, push-down, resource-bounded)


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional