Behavioral Rewrite Systems and Behavioral Productivity

From FSL
Revision as of 18:58, 13 October 2013 by Grosu (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Behavioral Rewrite Systems and Behavioral Productivity
Grigore Rosu and Dorel Lucanu
Futatsugi Festschrift 2014, LNCS 8373, pp 296-314. 2014
Abstract. This paper introduces behavioral rewrite systems, where rewriting is used to evaluate experiments, and behavioral productivity, which says that each experiment can be fully evaluated, and investigates some of their properties. First, it is shown that, in the case of (infinite) streams, behavioral productivity generalizes and may bring to a more basic rewriting setting the existing notion of stream productivity defined in the context of infinite rewriting and lazy strategies; some arguments are given that in some cases one may prefer the behavioral approach. Second, a behavioral productivity criterion is given, which reduces the problem to conventional term rewrite system termination, so that one can use off-the-shelf termination tools and techniques for checking behavioral productivity in general, not only for streams. Finally, behavioral productivity is shown to be equivalent to a proof-theoretic (rather than model-theoretic) notion of behavioral well-specifiedness, and its difficulty in the arithmetic hierarchy is shown to be \Pi_2^0-complete.
PDF, Slides(PPTX), CIRC, DOI, Futatsugi Festschrift 2014, BIB

Personal tools