Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties

We consider the model checking problem for Process Rewrite Systems (PRS s),an infinite-state formalism (non Turing-powerful) which subsumes many commonmodels such as Pushdown Processes and Petri Nets. PRS s can be adopted as for-mal models for programs with dynamic creation and synchronization of concurrentprocesses, and with recursive procedures. The model-checking problem for PRS sand action-based linear temporal logic (ALTL) is undecidable. However, decidabilityfor some interesting fragment of ALTL remains an open question. In this paper westate decidability results concerning generalized acceptance properties about infinitederivations (infinite term rewriting) in PRS s. As a consequence, we obtain decid-ability of the model-checking (restricted to infinite runs) for PRS s and a meaningfulfragment of ALTL.