2003
Report  Open Access

Team automata satisfying compositionality

Ter Beek M. H., Kleijn J.

Team automata  Multicast/broadcast communication  GNDC 

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.

Source: ISTI Technical reports, 2003



Back to previous page
BibTeX entry
@techreport{oai:it.cnr:prodotti:160088,
	title = {Team automata satisfying compositionality},
	author = {Ter Beek M. H. and Kleijn J.},
	institution = {ISTI Technical reports, 2003},
	year = {2003}
}