Satisfiability of High-Level Conditions

DOI10.1007/11841883_30zbMath1156.68428OpenAlexW1817911837MaRDI QIDQ3541979

Karl-Heinz Pennemann, Annegret Habel

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841883_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Categories of machines, automata (18B20)

Related Items (7)

Explicit State Model Checking for Graph Grammars ⋮ Attributed Graph Constraints ⋮ Development of Correct Graph Transformation Systems ⋮ An Algorithm for Approximating the Satisfiability Problem of High-level Conditions ⋮ Reasoning with graph constraints ⋮ A Logic of Graph Constraints ⋮ Correctness of high-level transformation systems relative to nested conditions

This page was built for publication: Satisfiability of High-Level Conditions