We propsoe decision procedures based on regions for two problems on pure unbounded Petri nets with injective labnelling.One problem is to construct nets from inconmplete specificaitons,given by pairs of regular languages that impose respectively upper and lower bounds on the expected behaviours.the second problem is to derive equivalent nets from deterministic pushdown automata,thus exhibiting their hidden concurrency.
展开▼
