Abstract
General net theory [l] is introduced in order to handle situations involving non sequential processes (concurrency, parallelism, synchronization, and so on). Such situations can he devised if one tries to interpret constructive logical proofs as algorithms solving tasks specified by first-order formulas.
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.
Similar content being viewed by others
References
W. Brauer (ed.) - Net theory and applications. Lect. No. in Comp. Sc. n. 84, Springer 1980
R.L. Constable - Constructive mathematics and automatic program writers. IFIP Congress, North Holland 1971.
C.A. Goad - Computational uses of the manipulation of formal proofs. Rep. STAN-CS-8O-819, Stanford University 1980,
S. Goto - Program synthesis trough GBdel’s interpretation. In E.K. Blum, S. Takasu (ed.), Proc. Int. Conf. on Math. Studies of Information processing, Kyoto University 198O.
Z. Manna, R. Waldinger - Towards automatic program synthesis. Symp. on semantics of algorithmic languages, Lect. No. in Math., Springer 1971.
J P. Martin Löf - Constructive mathematics and computer programming. Presented at the 6-th Congress for Logic, Methodology and Philosophy of Science, Hannover 1979
P- Miglioli, M. Ornaghi - A logically justified computing model. To appear in Fundamenta Informaticae 1981.
A.S. Troelstra - Aspects of constructive mathematics. In J. Barwise (ed.), Handbook of mathematical logic, North-Holland 1977.
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
Miglioli, P., Moscato, U., Ornaghi, M. (1982). Constructive Proofs as Programs Executable by PrT 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_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive