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.
Team automata satisfying compositionality
ter Beek MH;
2003
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_160088-doc_129620.pdf
accesso aperto
Descrizione: Team Automata Satisfying Compositionality
Dimensione
297.04 kB
Formato
Adobe PDF
|
297.04 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
