%0 Conference Proceedings
%F Jeron-STACS91
%A Jéron, T.
%T Testing for unboundedness of fifo channels
%B STACS 91 : Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany
%V 480
%P 322-333
%S LNCS
%I Springer-Verlag
%X 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
%U http://www.irisa.fr/vertecs/Publis/Ps/91-STACS.ps.gz
%8 February
%D 1991