Deriving bisimulation congruences in the presence of negative application conditions

  • Authors:

  • Guilherme Rangel;Barbara König;Hartmut Ehrig

  • Affiliations:

  • Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany;Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, Germany;Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany

  • Venue:
  • FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisimilarity is automatically a congruence. One important aspect that has not been studied so far is the treatment of reduction rules with negative application conditions. That is, a rule may only be applied if certain patterns are absent in the vicinity of a left-hand side. Our goal in this paper is to extend the borrowed context framework to label derivation with negative application conditions and to show that bisimilarity remains a congruence. An important application area is graph transformation and we will present a small example in order to illustrate the theory.