CAV
2008
Springer
14 years 10 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
90
Voted
STACS
2009
Springer
15 years 3 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...