×

zbMATH — the first resource for mathematics

Foundations of behavioural specification in rewriting logic. (English) Zbl 0912.68092
Meseguer, J. (ed.), Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3–6, 1996. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 4, 20 p. (1996).
Summary: We extend behavioural specification based on hidden sorts to rewriting logic by constructing a hybrid between the two underlying logics. This is achieved by defining a concept of behavioural satisfaction for rewriting logic. Our approach is semantic inthat it is based on a general construction on models, called behaviour image, which uses final models in an essential way. However we provide syntactic characterisations for the behavioural satisfaction relation, thus opening the door for shifting recent advanced proof techniques for behavioural satisfaction to rewriting logic. We also show that the rewriting logic behavioural satisfaction obeys the so-called “satisfaction condition” of the theory of institutions, thus providing support for OBJ style modularisation for this new paradigm.
For the entire collection see [Zbl 0903.00068].

MSC:
68Q42 Grammars and rewriting systems
68T27 Logic in artificial intelligence
PDF BibTeX XML Cite
Full Text: Link