The composition of two arbitrary component automata can have deadlock states. A method isproposed to minimally reduce a component automaton such that the resulting composition with theother automaton is deadlock-free. The method is applied to deriving compositionally deadlock-freesolutions of automata equations over the synchronous composition.
Deriving compositionally deadlock-free components under synchronous composition
VILLA, Tiziano;
2015-01-01
Abstract
The composition of two arbitrary component automata can have deadlock states. A method isproposed to minimally reduce a component automaton such that the resulting composition with theother automaton is deadlock-free. The method is applied to deriving compositionally deadlock-freesolutions of automata equations over the synchronous composition.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
