In: Lecture Notes in Computer Science, Vol. 1877: Concurrency Theory, Proceedings of CONCUR 2000, pages 442-457. Springer-Verlag, 2000.
Abstract: The paper proposes a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that are called inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. As a intermediate semantic model, inhibitor event structures are proposed, an extension of prime event structures able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs.
Keywords: Petri nets, category theory, functorial semantics, inhibitor arcs, read arcs.