Document - Team automata satisfying compositionality

2003

Conference article Closed Access

Team automata satisfying compositionality

Ter Beek M., Kleijn J.

Computation automata

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: FME 2003: Formal methods. International Symposium of Formal Methods, pp. 381–400, Pisa, Italy, September 2003

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:44085,
	title = {Team automata satisfying compositionality},
	author = {Ter Beek M. and Kleijn J.},
	doi = {10.1007/978-3-540-45236-2_22},
	booktitle = {FME 2003: Formal methods. International Symposium of Formal Methods, pp. 381–400, Pisa, Italy, September 2003},
	year = {2003}
}