Satisfiability of High-Level Conditions

  • Annegret Habel
  • Karl-Heinz Pennemann
Conference paper

DOI: 10.1007/11841883_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4178)
Cite this paper as:
Habel A., Pennemann KH. (2006) Satisfiability of High-Level Conditions. In: Corradini A., Ehrig H., Montanari U., Ribeiro L., Rozenberg G. (eds) Graph Transformations. ICGT 2006. Lecture Notes in Computer Science, vol 4178. Springer, Berlin, Heidelberg

Abstract

In this paper, we consider high-level structures like graphs, Petri nets, and algebraic specifications and investigate two kinds of satisfiability of conditions and two kinds of rule matching over these structures. We show that, for weak adhesive HLR categories with class \({\mathcal{A}}\) of all morphisms and a class \({\mathcal {M}}\) of monomorphisms, strictly closed under decompositions, \({\mathcal{A}}\)- and \({\mathcal{M}}\)-satisfiability and \({\mathcal{A}}\)- and \(P{\mathcal{M}}\)-matching are expressively equivalent. The results are applied to the category of graphs, where \({\mathcal{M}}\) is the class of all injective graph morphisms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Annegret Habel
    • 1
  • Karl-Heinz Pennemann
    • 1
  1. 1.Carl v. Ossietzky Universität OldenburgGermany

Personalised recommendations