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.
2015
submodule construction; compositionally deadlock-free or compositionallyprogressive solutions to automata equations; the unknown component problem
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/932591
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact