Deriving Compositionally Deadlock-free Componenets over Synchronous Automata Compositions
Journal
The Computer Journal
Journal Volume
58
Journal Issue
11
Pages
2793-2803
Date Issued
2015-11
Author(s)
Abstract
The composition of two arbitrary component automata can have deadlock states. A method is proposed to minimally reduce a component automaton such that the resulting composition with the other automaton is deadlock-free. The method is applied to deriving compositionally deadlock-free solutions of automata equations over the synchronous composition.
Type
journal article