The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Symbolic invariant verification for systems with dynamic structural adaptation
Proceedings of the 28th international conference on Software engineering
On the Recognizability of Arrow and Graph Languages
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Abstract regular tree model checking of complex dynamic data structures
SAS'06 Proceedings of the 13th international conference on Static Analysis
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We introduce graph automata as a more automata-theoretic view on (bounded) automaton functors and we present how automaton-based techniques can be used for invariant checking in graph transformation systems. Since earlier related work on graph automata suffered from the explosion of the size of the automata and the need of approximations due to the non-determinism of the automata, we here employ symbolic bdd-based techniques and recent antichain algorithms for language inclusion to overcome these issues. We have implemented techniques for generating, manipulating and analyzing graph automata and perform an experimental evaluation.