Abstract
We consider an example which is well known as “The Dining Philosophers Problem”. To start with, we represent it as a C/E-system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Schiffers, H. Wedde: Analyzing Program Solutions of Coordinated Problems by CP-Nets. Mathematical Foundations of Computer Science 1978, Lecture Notes in Computer Science 64 (1978), pp. 462–473
H. Genrich, K. Lautenbach: S-Invariance in Predicate/Transition Nets, in [19]. The distributed database example of Chap. 8.3 is taken from [29].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reisig, W. (1985). Predicate/Event-Nets. In: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69968-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-69968-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69970-2
Online ISBN: 978-3-642-69968-9
eBook Packages: Springer Book Archive