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 characterizations for L.
Cite
CITATION STYLE
Wimmel, H., & Priese, L. (1997). Algebraic characterization of petri net pomset semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1243, pp. 406–420). Springer Verlag. https://doi.org/10.1007/3-540-63141-0_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
