Abstract
In the following I propose a concept of Dynamic Occurrence Nets- These nets are “dynamic” in so far as they contain a “past part” which is an Occurrence Net in the classical sense (i. e. an Occurrence Graph) and a “future part” which is a repetition free condition/event net (/1/ p. 120). They are able to model any concurrent system without folding, and they can serve as internal models in digital computers for treating backward recovery problems /3/.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Genrich, H.J., K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory? Ins Brauer,W. (ed.)s Net Theory and Appiications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg 1979, Lecture Notes in Computer Science 84, pp. 21–163, Berlin, New Yorks Springer? 1980.
Petri, C. A. s Concurrency, ibid., pp. 251–260
Hinderer, W. s Rekonfiguration und Wiederanlauf in fehlertoleranten Systemen, FhG-Berichte 2–80, pp. 41–45, 1980
Merlin, P-M., B. Randells State Restoration in Distributed Systems, proceedings of Fault Tolerant Computing Symposium 8, France, 1978, pp. 129–134.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hinderer, W. (1982). Treatment of recovery problems using cuts in Occurrence Nets. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive