Concatenable weighted pomsets and their applications to modelling processes of Petri nets

Axiomatizing the subsumption and subword preorders on finite and infinite partial words

Theoretical Computer Science

Series and Parallel Operations on Pomsets

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science

Clusters, Confusion and Unfoldings

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)

Clusters, Confusion and Unfoldings

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)

A Representation of Processes of Petri Nets by Matrices

Fundamenta Informaticae