Abstract
Recursion is a widespread definition priciple in computer science. It allows for finite characterizations of infinite objects and provides tools for the construction of initial segments of these infinite objects. A special yet important subclass of recursion is iteration (which needs no storing of provisional results).
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
S. Eilenberg, C.C. Elgot: Recursiveness.- Academic Press, New York (1970)
H.J. Genrich, E. Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory.- in: Net Theory and Applications, Lecture Notes in Computer Science 84, Springer Verlag (1980)
U. Goltz, W. Reisig, P.S. Thiagarajan: Two Alternative Definitions of Synchronic Distance.- this volume
K. Jensen, N. Wirth: Pascal User Manual and Report.- Springer Verlag (1975)
R. Valette: Analysis of Petri Nets by Stepwise Refinements.- Journal of Computer and System Sciences 18, 35–46 (1979)
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
Reisig, W. (1982). Recursive 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_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive