For the most recent entries see the Petri Nets Newsletter.

Deriving Unbounded Petri Nets from Formal Languages.

Darondeau, Philippe

In: Sangiorgi, D.; de Simone, R.: Lecture Notes in Computer Science, Vol. 1466: Proceedings 9th International Conference on Concurrency Theory (CONCUR'98), Nice, France, September 1998, pages 533-548. Springer-Verlag, 1998.

Abstract: The authors propose decision procedures based on regions for two problems on pure unbounded Petri nets with injective labelling. The first problem is to construct nets from specifications of upper and lower bounds on behaviour. The second problem is to derive equivalent nets from deterministic pushdown automata.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography