Axioms for Contextual Net Processes (1998)
| Venue: | In Automata, Languages and Programming, volume 1443 of LNCS |
| Citations: | 14 - 9 self |
BibTeX
@INPROCEEDINGS{Gadducci98axiomsfor,
author = {F. Gadducci and U. Montanari},
title = {Axioms for Contextual Net Processes},
booktitle = {In Automata, Languages and Programming, volume 1443 of LNCS},
year = {1998},
pages = {296--308},
publisher = {Springer Verlag}
}
Years of Citing Articles
OpenURL
Abstract
. In the classical theory of Petri nets, a process is an operational description of the behaviour of a net, which takes into account the causal links between transitions in a sequence of firing steps. In the categorical framework developed in [19, 11], processes of a P/T net are modeled as arrows of a suitable monoidal category: In this paper we lay the basis of a similar characterization for contextual P/T nets, that is, P/T nets extended with read arcs, which allows a transition to check for the presence of a token in a place, without consuming it. 1 Introduction Petri nets [24] are probably the best studied and most used model for concurrent systems: Their range of applications covers a wide spectrum, from their use as a specification tool to their analysis as a suitable semantical domain. A recent extension to the classical model concerns a class of nets where transitions are able to check for the presence of a token in a place without actually consuming it. While the possibility ...







