Czaja, Ludwik Net-definability of process languages. (English) Zbl 0930.68094 Fundam. Inform. 37, No. 3, 213-223 (1999). Summary: Synthesis of elementary Petri net from a given process language (given by an expression in an algebra resembling the algebra of regular languages) is posed and solved. A necessary and sufficient condition for existence of such net is proved. Cited in 1 Document MSC: 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) 68Q45 Formal languages and automata Keywords:Petri net; process language PDFBibTeX XMLCite \textit{L. Czaja}, Fundam. Inform. 37, No. 3, 213--223 (1999; Zbl 0930.68094)