Place/Transition Petri net Evolutions: Recording Ways, Analysis and Synthesis

Issue title: Concurrency Specification and Programming Workshop (CS&P'2001)

Article type: Research Article

Authors: Czaja, Ludwik

Affiliations: Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland

Abstract: Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way. Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint.

Keywords: P/T Petri nets, processes, traces, dependence graphs, analysis, synthesis

Journal: Fundamenta Informaticae, vol. 51, no. 1-2, pp. 43-58, 2002