PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Ter Beek M. H., Kleijn J. Team Automata Satisfying Compositionality. The document has been submitted to Conference FM 2003: The 12th International FME Symposium, Technical report, 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 Team automata
Compositionality
Computations
Behaviour
Synchronizations
Shuffles
D.2.4 Software/Program Verification: Formal methods
D.3.1 Formal Definitions and Theory: Syntax
F.1.1 Models of Computation: Automata
F.4.3 Formal Languages: Operations on languages


Icona documento 1) Download Document PS
Icona documento 2) 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