The Regular Viewpoint on PA-Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

The Regular Viewpoint on PA-Processes


PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as {\em tree languages}. Our main result is that the set of iterated predecessors of a regular set of PA-processes 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 verification problems for PA-processes, among which a simple and general model-checking algorithm.
Fichier principal
Vignette du fichier
RR-3403.pdf (386.62 Ko) Télécharger le fichier

Dates and versions

inria-00073287 , version 1 (24-05-2006)


  • HAL Id : inria-00073287 , version 1


Denis Lugiez, Philippe Schnoebelen. The Regular Viewpoint on PA-Processes. [Research Report] RR-3403, INRIA. 1998, pp.27. ⟨inria-00073287⟩
48 View
150 Download


Gmail Facebook Twitter LinkedIn More