In: Mazurkiewicz, A.; Winkowski, J.: Lecture Notes in Computer Science, Vol. 1243: CONCUR'97: Concurrency Theory, 8th International Conference, Warsdaw, Poland, July 1997, pages 406-420. Germany, Berlin: Springer-Verlag, July 1997.
Abstract: Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote the pomset behaviour of N, and let P:=P(N)|N is a Petri net denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages. We present here an algebraic characterization for P, similar to the known algebraic characterization for L.