On conditions for defining a closed cover to verify progress for communicating finite state machines

Autor:	A. Chung, D.P. Sidhu
Rok vydání:	1989
Předmět:	Finite-state machine Theoretical computer science Cover (topology) FIFO (computing and electronics) Computer science Point (geometry) Partition (database) Algorithm Software
Zdroj:	IEEE Transactions on Software Engineering. 15:1491-1494
ISSN:	0098-5589
DOI:	10.1109/32.41341
Popis:	The closed-cover technique for verifying progress for two communicating finite-state machines exchanging messages over two lossless, FIFO channels is considered. The authors point out that the definition of a closed cover in M.G. Gouda (ibid., vol.SE-10, no.6, p.846-55, Nov. 1984) may be too restrictive, while that in M.G. Gouda and C.K. Chang (ACM Trans. Prog. Lang., vol.8, no.1, p.154-82, Jan. 1986) is not correct. They then show how a condition of the closed-cover definition can be modified to relax restriction to various degrees. They also discuss the similarities and relationship between the structural partition technique and the closed-cover technique. >
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::940590a63a7a9ffaadb14fbf86a52591 https://doi.org/10.1109/32.41341 Zobrazit plný text záznamu