Deriving compositionally deadlock-free components over synchronous automata compositions
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 aut...
| Published in: | The computer journal Vol. 58, № 11. P. 2793-2803 |
|---|---|
| Other Authors: | , , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000548741 Перейти в каталог НБ ТГУ |