Functional concurrent semantics for petri nets with read and inhibitor arcs

14Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call 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 the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. As an intermediate semantic model, we introduce inhibitor event structures, an extension of prime event structures able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Baldan, P., Busi, N., Corradini, A., & Pinna, G. M. (2000). Functional concurrent semantics for petri nets with read and inhibitor arcs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1877 LNCS, pp. 442–457). Springer Verlag. https://doi.org/10.1007/3-540-44618-4_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free