Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Gziped Postscript (.ps.gz)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Unsolvability of the unboundedness problem for specification models allowing Fifo channels was proved a few years ago by Brand and Zafiropulo. The paper investigates a testing approach of that problem. Instead of reducing the model in order to give decidability results, we work with the largest possible framework and find a sufficient condition for unboundedness based on a relation between the nodes of the reachability tree. The construction of the resulting reduced tree can then be applied as well to communicating finite state machines as to Fifo-Nets. Moreover, the test extends existing decidability results. A few modifications of the relation make it available for Estelle specifications.
Thierry Jéron
Thierry.Jeron@irisa.fr
@InProceedings{Jeron-STACS91,
Author = {Jéron, T.},
Title = {Testing for unboundedness of fifo channels},
BookTitle = {STACS 91 : Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany},
Volume = {480},
Pages = {322--333},
Series = {LNCS},
Publisher = {Springer-Verlag},
Month = {February},
Year = {1991}
}
Get EndNote Reference (.ref)