Compositional specification in rewriting logic

Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code eac...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-01
Main Authors: Martín, Óscar, Verdejo, Alberto, Martí-Oliet, Narciso
Format: Article
Language:English
Subjects:
Complex systems
Logic programming
Semantics
Specifications
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose a complex system into its functional components and code each as an isolated and encapsulated system. Our goal is to help bringing compositionality to system specification in rewriting logic. The base of our proposal is the operation that we call synchronous composition. We discuss the motivations and implications of our proposal, formalize it for rewriting logic and also for transition structures, to be used as semantics, and show the power of our approach with some examples. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).
ISSN:2331-8422
DOI:10.48550/arxiv.1908.11769