Approximating Petri Net Reachability Along Context-free Traces

Details Approximating Petri Net Reachability Along Context-free Traces Approximating Petri Net Reachability Along Context-free Traces

2011-05-09

arxiv.org/abs/1105.1657v3

Computer Science

Formal Languages and Automata Theory

16 pages

Scientific paper

10.4230/LIPIcs.FSTTCS.2011.152

We investigate the problem asking whether the intersection of a context-free language (CFL) and a Petri net language (PNL) is empty. Our contribution to solve this long-standing problem which relates, for instance, to the reachability analysis of recursive programs over unbounded data domain, is to identify a class of CFLs called the finite-index CFLs for which the problem is decidable. The k-index approximation of a CFL can be obtained by discarding all the words that cannot be derived within a budget k on the number of occurrences of non-terminals. A finite-index CFL is thus a CFL which coincides with its k-index approximation for some k. We decide whether the intersection of a finite-index CFL and a PNL is empty by reducing it to the reachability problem of Petri nets with weak inhibitor arcs, a class of systems with infinitely many states for which reachability is known to be decidable. Conversely, we show that the reachability problem for a Petri net with weak inhibitor arcs reduces to the emptiness problem of a finite-index CFL intersected with a PNL.

Affiliated with

Also associated with

No associations

Rating

Approximating Petri Net Reachability Along Context-free Traces 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 Approximating Petri Net Reachability Along Context-free Traces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Petri Net Reachability Along Context-free Traces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333961