Testing for the unboundedness of fifo channels in programs (1) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Testing for the unboundedness of fifo channels in programs (1)

Thierry Jéron

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. We find a sufficient condition for unboundedness based on a relation between reachable global states. This gives a testing procedure which can be applied as well to communicating finite state machines as to Fifo-Nets. Moreover, the test extends existing decidability results. In fact it becomes a decision procedure for a class of systems strictly including linear and monogeneous systems. A few modifications of the relation make it available for Estelle specifications.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1159.pdf (1.41 Mo) Télécharger le fichier

Dates and versions

inria-00075399 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075399 , version 1

Cite

Thierry Jéron. Testing for the unboundedness of fifo channels in programs (1). [Research Report] RR-1159, INRIA. 1990. ⟨inria-00075399⟩
148 View
64 Download

Share

Gmail Facebook X LinkedIn More