The regular viewpoint on PA-processes [chapter]

D. Lugiez, Ph. Schnoebelen
1998 Lecture Notes in Computer Science  
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata techniques for verification problems on PA. Our main result is that the set of iterated predecessors of a regular set of PAprocesses is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built effectively in polynomial-time. This has many immediate applications to
more » ... verification problems for PA-processes, among which a simple and general model-checking algorithm.
doi:10.1007/bfb0055615 fatcat:tzt5syvuxrb7bjt53tx7hnbkjq