Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
IJ.J.Aalbersberg, G.Rozenberg; Theory of traces, Theor. Comput. Sci. 60 (1988), 1–82
E.Best, R.Devillers; Sequential and concurrent behaviour in Petri net theory; Theor. Comput. Sci. 55 (1987), 87–136
E.Best, C.Fernández C.; Nonsequential Processes, EATCS Monographs on Theoretical Computer Science, Vol.13, Springer-Verlag, Berlin, 1988
W.Brauer, W.Reisig, G.Rozenberg, eds.; Petri Nets: Central Models and their Properties, Lecture Notes in Computer Science 254, Springer-Verlag, Berlin, 1987
J.Desel, J.Esparza; Free Choice Petri Nets, Cambridge University Press, Cambridge, 1995
V.Diekert, G.Rozenberg, eds.; The Book of Traces, World Scientific, Singapore, 1995
A.Ehrenfeucht, G.Rozenberg; Partial 2-structures; Part II: State spaces of concurrent systems, Acta Informatica 27 (1990), 348–368
J.Engelfriet; Determinacy → (observation equivalence = trace equivalence), Theor. Comput. Sci. 36 (1985), 21–25
J.Engelfriet; Branching processes of Petri nets, Acta Informatica 28 (1991),575–591
J.Esparza; Model checking using net unfoldings, Science of Computer Programming 23 (1994), 151–195
J.Esparza, S.Römer, W.Vogler; An improvement of McMillan's unfolding algorithm, in Tools and Algorithms for the Construction and Analysis of Systems (T.Margaria, B.Steffen, eds.), Proc. TACAS'96, Lecture Notes in Computer Science 1055, Springer-Verlag, Berlin, 1996, pp.87–106
H.J.Genrich; Predicate/Transition nets, in [BraReiRoz87], pp.207–247
M.H.T.Hack; Analysis of production schemata by Petri nets, M.S. Thesis, MIT, Project MAC, Cambridge, Mass., 1972
P.W.Hoogers; Behavioural aspects of Petri nets, Ph.D.Thesis, Leiden University, 1994
H.J.Hoogeboom, G.Rozenberg; Diamond properties of elementary net systems, Fundamenta Informaticae 14 (1991), 287–300
H.J.Hoogeboom, G.Rozenberg; Dependence graphs, Chapter 2 of [DieRoz95]
J.E.Hopcroft, J.D.Ullman; Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979
K.Jensen; Coloured Petri Nets, EATCS Monographs on Theoretical Computer Science, in three Volumes, Springer-Verlag, Berlin, 1992, 1994, and 1997
L.H.Landweber, E.L.Robertson; Properties of conflict free and persistent Petri nets, J. of the ACM 25 (1978), 352–364
A.Mazurkiewicz; Introduction to trace theory, Chapter 1 of [DieRoz95]
K.L.McMillan; Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, in TComputer Aided Verification (G.v.Bochmann, D.K.Probst, eds.), Proc. CAV'92, Lecture Notes in Computer Science 663, Springer-Verlag, Berlin, 1993, pp. 164–177
K.L.McMillan, A technique of a state space search based on unfolding, Formal Methods in System Design 6 (1995), 45–65; see also [McM93]
R.Milner; Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ., 1989
M.Nielsen, G.Plotkin, G.Winskel; Petri nets, event structures and domains, Part 1, Theor. Comput. Sci. 13 (1981), 85–108
M.Nielsen, G.Rozenberg, P.S.Thiagarajan; Behavioural notions for elementary net systems, Distributed Computing 4 (1990), 45–59 (see also [Thi90])
M.Nielsen, G.Rozenberg, P.S.Thiagarajan; Elementary transition systems, Theor. Comput. Sci. 96 (1992), 3–33
M.Nielsen, G.Rozenberg, P.S.Thiagarajan; Elementary transition systems and refinement, Acta Informatica 29 (1992), 555–578
M.Nielsen, G.Rozenberg, P.S.Thiagarajan; Transition systems, event structures, and unfoldings, Inform. and Comput. 118 (1995), 191–207
E.Ochmański; Recognizable trace languages, Chapter 6 of [DieRoz95]
C.A.Petri; Kommunikation mit Automaten, Rheinisch-Westfälisches Institut für Instrumentelle Mathematik an der Universität Bonn, Schrift Nr.2, 1962
C.A.Petri; Nicht-sequentielle Prozesse, Universität Erlangen — Nürnberg, Arbeitsberichte des IMMD, Vol.9, Nr.8, 57–82, 1976
J.L.Peterson; Petri Net Theory and the Modeling of Systems; Prentice-Hall, Englewood Cliffs, 1981
L.Pomello; Osservatore, reti di Petri, processi, Ph.D.Thesis, Universities of Milano and Turino, 1988
L.Pomello, G.Rozenberg, C.Simone; A survey of equivalence notions for net based systems, Advances in Petri Nets 1992 (G.Rozenberg, ed.), Lecture Notes in Computer Science 609, Springer-Verlag, Berlin, 1992, pp.410–472
V.R.Pratt; Modelling concurrency with partial orders, Int. J. of Parallel Programming 15 (1986), 33–71
W.Reisig; Petri Nets, EATCS Monographs on Theoretical Computer Science, Vol.4, Springer-Verlag, Berlin, 1982
G.Rozenberg; Behaviour of elementary net systems, in [BraReiRoz87], pp.60–94
G.Rozenberg, P.S.Thiagarajan; Petri nets: basic notions, structure, behaviour, in Current Trends in Concurrency (J.W.de Bakker, W.-P.de Roever, G.Rozenberg, eds.), Lecture Notes in Computer Science 224, Springer-Verlag, Berlin, 1986, pp.585–668
B.Rozoy, P.S.Thiagarajan; Event structures and trace monoids, Theor. Comput. Sci. 91 (1991), 285–313
D.Taubner; Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Lecture Notes in Computer Science 369, Springer-Verlag, Berlin, 1989
P.S.Thiagarajan; Elementary net systems, in [BraReiRoz87], pp.26–59
P.S.Thiagarajan; Some behavioural aspects of net theory, Theor. Comput. Sci. 71 (1990), 133–153
F.W.Vaandrager; Determinism → (event structure isomorphism = step sequence equivalence), Theor. Comput. Sci. 79 (1991), 275–294
G.Winskel; Event structures, in Petri Nets: Applications and Relationships to other Models of Concurrency (W.Brauer, W.Reisig, G.Rozenberg, eds.), Lecture Notes in Computer Science 255, Springer-Verlag, Berlin, 1987, pp.325–392
G.Winskel, M.Nielsen; Models for concurrency, in Handbook of Logic in Computer Science (S.Abramsky, D.M.Gabbay, T.S.E.Maibaum, eds.), Vol.4: Semantic Modelling, pp.1–148, Clarendon Press, Oxford, 1995
G.Winskel, M.Nielsen; Trace structures and other models for concurrency, Chapter 9 of [DieRoz95]
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rozenberg, G., Engelfriet, J. (1998). Elementary net systems. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I: Basic Models. ACPN 1996. Lecture Notes in Computer Science, vol 1491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65306-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-65306-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65306-6
Online ISBN: 978-3-540-49442-3
eBook Packages: Springer Book Archive