Well-Structured Graph Transformation Systems with Negative Application Conditions

@inproceedings{Knig2012WellStructuredGT,
  title={Well-Structured Graph Transformation Systems with Negative Application Conditions},
  author={Barbara K{\"o}nig and Jan St{\"u}ckrath},
  booktitle={ICGT},
  year={2012}
}
Given a transition system and a partial order on its states, the coverability problem is the question to decide whether a state can be reached that is larger than some given state. For graphs, a typical such partial order is the minor ordering, which allows to specify “bad graphs” as those graphs having a given graph as a minor. Well-structuredness of the transition system enables a finite representation of upward-closed sets and gives rise to a backward search algorithm for deciding… CONTINUE READING