| Year | 2003 |
|---|---|
| Type | Journal |
| Status | Published |
| Authors | Dorel Lucanu |
Links
Abstract
We modify the definition of the models for rewrite theories by replacing the equality of functors, defined by E-equal terms, with the equality via a natural isomorphism, called natural symmetry. The relaxation process can be adapted by relaxing all or only a part of the equations, and by relaxing the state structure (and implicitly the computation structure) or just the computation structure. We also consider the subclasses of C-coherent models, where C is a set of equations specifying a collection of commutative symmetry diagrams. The result is a wide palette of model classes which offers more flexibility in modeling concurrent systems.
BibTeX
@ARTICLE{rewinst,
author = {Lucanu, D.},
title = {Relaxed Models for Rewriting Logic},
journal = {Theoretical Computer Science},
year = {2003},
volume = {290},
pages = {265-289},
number = {1},
url = {http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=%23TOC%235674%232003%23997099998%23351904%23FLA%23&_cdi=5674&_pubType=J&_auth=y&_acct=C000228598&_version=1&_urlVersion=0&_userid=10&md5=8aea01ed398c12d55903c0e585f69588 [TCS]},
note = {ISI Impact Factor 0,764}
}