Deriving Compositionally Deadlock-Free Components over Synchronous Automata Compositions.

Nina Yevtushenko,Khaled El-Fakih,Tiziano Villa,Jie-Hong R. Jiang

The Computer Journal（2015）

引用 2|浏览8

暂无评分

摘要

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.

查看译文

关键词

formal methods,submodule construction,compositionally deadlock-free or compositionally progressive solutions to automata equations,the unknown component problem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要