In: Lecture Notes in Computer Science, Vol. 1466: Concurrency Theory (CONCUR'98), pages 533-548. Springer-Verlag, 1998.
Abstract: The paper proposes procedures based on regions for two problems on pure unbounded Petri nets with injective labeling. One problem is to construct nets from incomplete specifications, given by pairs of regular languages that impose respectively upper and lower bounds on the expected behaviors. The second problem is to derive equivalent nets from deterministic pushdown automata, thus exhibiting their hidden concurrency.
Keywords: formal languages, unbounded Petri nets.
Back to the Petri Nets Bibliography