Net-Definability of Process Languages
Ludwik Czaja · Fundamenta Informaticae · 1999
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.