Axioms for contextual net processes. (English) Zbl 0912.68142
Larsen, Kim G. (ed.) et al., Automata, languages and programming. 25th international colloquium, ICALP ’98. Aalborg, Denmark, July 13–17, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1443, 296-308 (1998).
Summary: 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 P. Degano, J. Meseguer and U. Montanari [Acta Inf. 33, No. 7, 641-667 (1996; Zbl 0849.68087)] and J. Meseguer and U. Montanari [Inf. Comput. 88, No. 2, 105-155 (1990; Zbl 0711.68077)], 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.
For the entire collection see [Zbl 0893.00039].
For the entire collection see [Zbl 0893.00039].
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
| 18D10 | Monoidal, symmetric monoidal and braided categories (MSC2010) |
