Satisfiability of High-Level Conditions.

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. [ABSTRACT FROM AUTHOR]