An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems
Anne Labroue, Philippe Schnoebelen · Electronic Notes in Theoretical Computer Science · 2002
We show how the tree-automata techniques proposed by Lugiez and Schnoebelen apply to the reachability analysis of RPPS systems. Using these techniques requires that we express the states of RPPS systems in a tailor-made process rewrite system where reachability is a relation recognizable by finite tree-automata.