A well-structured framework for analysing petri net extensions
Transition systems defined from recursive functions N-P --> N-P are introduced and named WSNs. or well-structured nets. Such nets sit conveniently between Petri net extensions and general transition systems. In the first part of this paper, we study decidability properties of WSN classes obtained by imposing natural restrictions on their defining functions, with respect to termination, coverability. and four variants of the boundedness problem. We are able to precisely answer almost all the questions which arise. thus gaining much insight into old and new generalized Petri net decidability results. In the second part. we specialize our analysis to WSNs defined from affine functions, which elegantly encompass most Petri net extensions studied in the literature. Again, we study decidability properties of natural classes of affine WSN with respect to the above six computational problems. In particular, we develop an algorithm computing limits of iterated nonnegative affine functions, in order to decide the path-place variant of the boundedness problem for non-negative affine WSN. (C) 2004 Published by Elsevier Inc.
decidability algorithms lopic and verification of computer program theory of parallel and distributed computation