Jeron-STACS91

T. Jéron. Testing for unboundedness of fifo channels. In STACS 91 : Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, LNCS, Volume 480, Pages 322-333, February 1991.

Download [help]

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

Abstract

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

Contact

Thierry Jéron http://www.irisa.fr/prive/jeron

BibTex Reference

@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}
}

EndNote Reference [help]

Get EndNote Reference (.ref)