Verification of recursive parallel systems

Details Verification of recursive parallel systems Verification of recursive parallel systems

2003-12-11

arxiv.org/abs/cs/0312019v1

Computer Science

Logic in Computer Science

49 pages, 1 figure

Scientific paper

In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state systems described by PRSs. In order to exemplify the assessed results, we introduce a meaningful automaton based formalism which allows to express both recursion and multi--treading.

Affiliated with

Also associated with

No associations

Rating

Verification of recursive parallel systems 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 Verification of recursive parallel systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verification of recursive parallel systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-726158