zbMATH — the first resource for mathematics

Elementary transition systems. (English) Zbl 0759.68022
The relation between elementary net systems [M. Nielsen, G. Rozenberg and P. S. Thiagarajan, Behavioural notion for elementary net systems, Distributed Computing 4, 45-57 (1990); P. S. Thiagarajan, Lect. Notes Comput. Sci. 254, 26-59 (1986; Zbl 0636.68063); G. Rozenberg, Lect. Notes Comput. Sci. 254, 60-94 (1986; Zbl 0636.68064)] and transition systems is studied through the notion of elementary transition systems, denoting a subclass of the class of all transition systems. It is shown, how behaviour preserving transformations between elementary net systems correspond to those between elementary transition systems. With the help of category theory net morphisms and various other morphisms between transition systems are studied. This work is a good companion to [loc. cit.] and other related works.

68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Full Text: DOI
[1] Aalbersberg, IJ.J.; Rozenberg, G., Theory of traces, ()
[2] Best, E.; Fernandez, C., Non-sequential processes: a Petri net view, Vol. 13, (1988), Springer Berlin, EATCS Monographs on Theoretical Computer Science · Zbl 0656.68005
[3] Desel, J.; Merceron, A., Vicinity respecting net morphisms, (), 165-185, Lecture Notes in Computer Science
[4] Ehrenfeucht, A.; Rozenberg, G., Partial 2-structures, Acta inform., 27, 348-368, (1990), Part II: State spaces of concurrent systems · Zbl 0696.68083
[5] Johnstone, P.T., Stone spaces, Vol. 3, (1982), Cambridge University Press Cambridge, Cambridge Studies in Advanced Mathematics · Zbl 0499.54001
[6] MacLane, S., Categories for the working Mathematician, Vol. 5, (1971), Springer Berlin, Graduate Texts in Mathematics
[7] Mazurkiewicz, A., (), 285-363, Lecture Notes in Computer Science
[8] Meseguer, J.; Montanari, U., Petri nets are monoids: A new algebraic foundation for net theory, (), 155-164
[9] Nielsen, M.; Plotkin, G.; Winskel, G., Petri nets, event structures and domains, part I, Theoret. comput. sci., 13, 85-108, (1981) · Zbl 0452.68067
[10] Nielsen, M.; Rozenberg, G.; Thiagarajan, P.S., Behavioural notion for elementary net systems, Distributed computing, 4, 45-57, (1990)
[11] Petri, C.A., Concepts of net theory, (), 137-146 · Zbl 1027.68642
[12] Petri, C.A., Non-sequential processes, ()
[13] Reisig, W.; Smid, E., The semantics of a net is a net—an exercise in general net theory, (), 461-480
[14] Rozenberg, G., Behaviour of elementary net systems, (), 60-94, Lecture Notes in Computer Science · Zbl 0636.68064
[15] Thiagarajan, P.S., Elementary net systems, (), 26-59, Lecture Notes in Computer Science · Zbl 0636.68063
[16] Winskel, G., Lecture notes on concurrency, (1982), Department of Computer Science, Carnegie-Mellon University
[17] Winskel, G., Synchronization trees, Theoret. comput. sci., 34, 33-82, (1984) · Zbl 0985.68514
[18] Winskel, G., Event structures, (), 325-392, Lectures Notes in Computer Science
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.