Productivity of Stream Definitions

J. Endrullis, C.A. Grabmayer, R.D.A. Hendriks, A. Ishihara, J.W. Klop

Research output: Contribution to JournalArticleAcademicpeer-review


We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called 'productive' if it can be evaluated continually in such a way that a uniquely determined stream in constructor normal form is obtained as the limit. Whereas productivity is undecidable for stream definitions in general, we show that it can be decided for 'pure' stream definitions. For every pure stream definition the process of its evaluation can be modelled by the dataflow of abstract stream elements, called 'pebbles', in a finite 'pebbleflow net(work)'. And the production of a pebbleflow net associated with a pure stream definition, that is, the amount of pebbles the net is able to produce at its output port, can be calculated by reducing nets to trivial nets. © 2009 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)765-782
JournalTheoretical Computer Science
Issue number4-5
Publication statusPublished - 2010


Dive into the research topics of 'Productivity of Stream Definitions'. Together they form a unique fingerprint.

Cite this