Abstract
PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) [Chr93] and context-free processes (BPA). They axe a simple model for infinite state concurrent systems. We show that the model checking problem for 'the branching time temporal logic EF is decidable for PA-processes.
Author supplied keywords
Cite
CITATION STYLE
Mayr, R. (1997). Model checking PA-processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1243, pp. 332–346). Springer Verlag. https://doi.org/10.1007/3-540-63141-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
