-
Views
-
Cite
Cite
Nina Yevtushenko, Khaled El-Fakih, Tiziano Villa, Jie-Hong R. Jiang, Deriving Compositionally Deadlock-Free Components over Synchronous Automata Compositions, The Computer Journal, Volume 58, Issue 11, November 2015, Pages 2793–2803, https://doi.org/10.1093/comjnl/bxu117
- Share Icon Share
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.
This content is only available as a PDF.
© The British Computer Society 2014. All rights reserved. For Permissions, please email: [email protected]
You do not currently have access to this article.