RAIRO-Theor. Inf. Appl.
Volume 37, Number 1, January/March 2003
|Page(s)||17 - 38|
|Published online||15 November 2003|
On the Analysis of Petri Nets and their Synthesis from Process Languages
Institute of Informatics, Warsaw
University, ul. Banacha 2, 02-097 Warsaw, Poland; email@example.com.
Accepted: December 2002
Processes in Place/Transition (P/T) nets are defined inductively by a peculiar numbering of place occurrences. Along with an associative sequential composition called catenation and a neutral process, a monoid of processes is obtained. The power algebra of this monoid contains all process languages with appropriate operations on them. Hence the problems of analysis and synthesis, analogous to those in the formal languages and automata theory, arise. Here, the analysis problem is: for a given P/T net with an initial marking find the set of all processes the net may evoke. The synthesis problem is: given a process language L decide if there exists a marked net whose evolutions (represented by processes) are collected in L and, in the positive case, find such net and its initial marking. The problems are posed and given a general solution.
Mathematics Subject Classification: 68Q85
Key words: Petri net / process language / analysis and synthesis of nets.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.