T. Jéron, C. Jard. Testing for Unboundedness of Fifo Channels. Theoretical Computer Science, 113:93-117, 1993.
Download paper:
Gziped Postscript
Copyright notice:
This 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.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
Undecidability 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. Dealing with the general framework of systems communicating through fifo channels, we 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. As a matter of fact, it becomes a decision procedure for a class of systems strictly including linear and monogeneous systems which are the two essential classes in which decidability is already known. In order to conclude our study on a practical view, we show that a few modifications of the relation make the test available for Estelle specifications
Thierry Jéron http://www.irisa.fr/prive/jeron
@article{Jeron-Jard-TCS93,
Author = {Jéron, T. and Jard, C.},
Title = {Testing for Unboundedness of Fifo Channels},
Journal = {Theoretical Computer Science},
Volume = {113},
Pages = {93--117},
Year = {1993}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |