Model checking for Process Rewrite Systems and a class of action--based regular properties

Details Model checking for Process Rewrite Systems and a class of action--based regular properties Model checking for Process Rewrite Systems and a class of action--based regular properties

2004-05-03

arxiv.org/abs/cs/0405003v1

Computer Science

Other Computer Science

31 pages, 1 figures

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Model checking for Process Rewrite Systems and a class of action--based regular properties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model checking for Process Rewrite Systems and a class of action--based regular properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model checking for Process Rewrite Systems and a class of action--based regular properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234829