*For the most recent entries see the
Petri Nets Newsletter.*

## Interpreted nets.

Czaja, L.
In:
*Concurrency, Specification and Programming CS&P'2006, Vol. 1: Concurrency. Informatik-Bericht Nr. 206 der Humbold-Universität zu Berlin, Eds.: G. Lindemann, H. Schlingloff.*, pages 15-25.
September 2006.

Abstract:
The nets considered here are an extension of Petri nets in two aspects. In
the semantical aspect, there is no one firing rule common to all
transitions, but every transition is treated as an operator on data stored
in its entry places and return results in its exit places. A state
(marking) is a mapping of places (variables) into a given data structure,
while interpretation is a mapping of transitions into a set of state
transformers. Locality of transition's activity is like in Petri nets. In
the structural aspect, entry and exit places to a transition are ordered.
A concatenation of such nets is defined, hence their calculus (a monoid).
This allows for combining small nets into large ones, in particular
designing a computation and control parts separately, then putting them
together into one. Such extended nets may produce, in particular, other
nets. A number of properties of the operation on nets and their
decomposition are demonstrated.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*