Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T16:26:07.452Z Has data issue: false hasContentIssue false

On the Analysis of Petri Netsand their Synthesis fromProcess Languages

Published online by Cambridge University Press:  15 November 2003

Ludwik Czaja*
Affiliation:
Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland; lczaja@mimuw.edu.pl.
Get access

Abstract

Processes in Place/Transition (P/T) nets are definedinductively by a peculiar numbering of place occurrences. Alongwith an associative sequential composition called catenation and a neutralprocess, a monoid of processes is obtained. The power algebra of this monoidcontains all process languages with appropriate operations on them. Hencethe problems of analysis and synthesis, analogous to those in the formallanguages and automata theory, arise. Here, the analysis problem is: for agiven P/T net with an initial marking find the set of all processes the netmay evoke. The synthesis problem is: given a process language Ldecide if there exists a marked net whose evolutions (represented byprocesses) are collected in L and, in the positive case, find suchnet and its initial marking. The problems are posed and given a generalsolution.

Information

Type
Research Article
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable