×

Petri nets with individual tokens. (English) Zbl 0604.68068

In the well-known model of Petri nets (place/transition nets), actual system states are represented as distributions of ’black’ tokens on the places on the nets. Such tokens cannot be identified as individual objects. The introduction of individual objects as tokens considerably increases the descriptive power of nets and allows for small but efficient models of real systems.
This paper presents such nets and illuminates their mathematical background. Our central concern is an intuitively and mathematically simple and transparent calculus of invariants, i.e., a powerful analysis technique.
Other models of nets with individual tokens, viz. Predicate/Transition nets and coloured nets, will be translated to our calculus. In this way our invariant techniques become applicable to those models.

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Full Text: DOI

References:

[1] Eilenberg, S., (Automata, Languages, and Machines, Vol. A (1974), Academic Press: Academic Press New York/London) · Zbl 0317.94045
[2] Genrich, H.; Lautenbach, K., The analysis of distributed systems by means of Predicate/Transition-nets, (Kahn, G., Semantics of Concurrent Computation. Semantics of Concurrent Computation, Lecture Notes in Computer Science, 70 (1979), Springer: Springer Berlin), 123-146 · Zbl 0407.68066
[3] Genrich, H.; Lautenbach, K., System modelling with high-level Petri nets, Theoret. Comput. Sci., 13, 109-136 (1981) · Zbl 0454.68052
[4] Genrich, H.; Stankiewicz-Wiechno, E., A dictionary of some basic notions of net theory, (Brauer, W., Net Theory and Applications. Net Theory and Applications, Lecture Notes in Computer Science (1980), Springer: Springer Berlin)
[5] Jensen, K., Coloured Petri nets and the invariant method, Theoret. Comput. Sci., 14, 317-336 (1981) · Zbl 0475.68035
[6] Jensen, K., How to find invariants for coloured Petri nets, (Mathematical Foundations of Computer Science. Mathematical Foundations of Computer Science, 1981. Mathematical Foundations of Computer Science. Mathematical Foundations of Computer Science, 1981, Lectures Notes in Computer Science, 118 (1981), Springer: Springer Berlin) · Zbl 0473.68056
[7] Lang, S., Algebra (1965), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0193.34701
[8] Lautenbach, K.; Pagnoni, A., Invariance and duality in Predicate/Transition nets and in coloured nets, Arbeitspapiere der Gesellschaft für Mathematik und Datenverarbeitung No. 132 (1985) · Zbl 0548.68062
[9] Reisig, W., Petri nets, (EATCS Monograph, 4 (1985), Springer: Springer Berlin) · Zbl 0521.68057
[10] Thatcher, J. W.; Wagner, E. G.; Wright, J. B., Data type specification: Parametrization, and the power of specification techniques, ACM Trans. Programming Languages and Systems, 4, 4, 711-732 (1982) · Zbl 0495.68020
[11] Voss, K., Nets as a consistent formal tool for the stepwise design and verification of a distributed system, (Hawgood, J., Evolutionary Information Systems (1982), North-Holland: North-Holland Amsterdam)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.