In: Freksa, C.; Jantzen, M.; Valk, R.: Lecture Notes in Computer Science, Vol. 1337: Foundations of Computer Science: Potential - Theory - Cognition, pages 233-238. Springer-Verlag, 1997.
Abstract: A reformulation of the standard causal semantics for Petri nets is proposed which allows one to reconstruct a partial order run from sequential observations without any knowledge of the underlying net structure or its current marking. It provides a new solution to how Mazurkiewicz's trace theory can be generalized to unbounded nets.
Keywords: Petri nets, partial orders, trace theory.