×

Deriving unbounded Petri nets from formal languages. (English) Zbl 0940.68097

Sangiorgi, Davide (ed.) et al., CONCUR ’98. Concurrency theory. 9th international conference, Nice, France, September 8-11, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1466, 533-548 (1998).
Summary: We propose decision 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 behaviours. The second problem is to derive equivalent nets from deterministic pushdown automata, thus exhibiting their hidden concurrency.
For the entire collection see [Zbl 0895.00051].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q45 Formal languages and automata
PDFBibTeX XMLCite