Sciweavers

FM
2003
Springer
89views Formal Methods» more  FM 2003»
14 years 4 months ago
Team Automata Satisfying Compositionality
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...
Maurice H. ter Beek, Jetty Kleijn