×

Net-definability of process languages. (English) Zbl 0930.68094

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.

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q45 Formal languages and automata
PDFBibTeX XMLCite