### Abstract

An abstraction operator for configuration structures is defined and it is proven that it is left inverse to the traditional refinement operator. The abstraction operator describes how concrete behaviour looks when observed from a more abstract level, where the difference between concrete and abstract is given by a transformation mapping. This generates a notion of implementation: L is said to implement H iff L is mapped to H by the abstraction operator. The implementation relation generated by the abstraction operator is strictly more general than the implementation function defined by a refinement operator, thus allowing a more flexible design process for distributed systems.

Original language | Undefined |
---|---|

Place of Publication | Hildesheim, Germany |

Publisher | Institut für Informatik, University of Hildesheim |

Number of pages | 38 |

Publication status | Published - 1992 |

### Publication series

Name | Hildesheimer Informatik-Bericht |
---|---|

Publisher | Institut für Informatik, University of Hildesheim |

No. | 18/92 |

ISSN (Print) | 0941-3014 |

### Keywords

- IR-66518
- EWI-7568

## Cite this

Costantini, R., & Rensink, A. (1992).

*Abstraction and Refinement in Configuration Structures*. (Hildesheimer Informatik-Bericht; No. 18/92). Hildesheim, Germany: Institut für Informatik, University of Hildesheim.