The main feature of zero-safe nets is a primitive notion of transition synchronization. To this aim, besides ordinary places, called stable places, zero-safe nets are equipped with zero places, which in an observable marking cannot contain any token. This yields the notion of transaction: A basic atomic computation, which may use zero tokens as triggers, but defines an evolution between observable markings only. The abstract counterpart of a generic zero-safe net B consists of an ordinary P/T net whose places are the stable places of B and whose transitions represent the transactions of B. The two nets offer the refined and the abstract models of the same system, respectively, where the former can be much smaller than the latter, because of the transition synchronization mechanism. Depending on the chosen approach - collective vs individual token philosophy - two notions of transaction may be defined, each leading to different operational and abstract models. Their comparison is fully discussed on the basis of a multicasting system example. In the second part of the paper, we make use of category theory to analyze and motivate our framework. More precisely, the two operational semantics of zero-safe nets are characterized as adjunctions, and the derivation of abstract P/T nets as coreflections. © 2000 Academic Press.
CITATION STYLE
Bruni, R., & Montanari, U. (2000). Zero-safe nets: Comparing the collective and individual token approaches. Information and Computation, 156(1–2), 46–89. https://doi.org/10.1006/inco.1999.2819
Mendeley helps you to discover research relevant for your work.