1. Term Rewriting and All That;Baader,1998
2. Decidability of bisimulation equivalence for processes generating context-free languages;Baeten,1987
3. An automata-theoretic approach to branching-time model checking;Kupferman;J. ACM,2000
4. Reachability analysis of pushdown automata;Bouajjani,1997