Abstract
A perpetual process is a program which does not terminate and yet is doing useful computation, in some sense. With the advent of PROLOG systems for concurrent applications [11], [12], [54], especially operating systems, more and more programs will be of this type. Unfortunately, the semantics for logic programs developed in chapters 1 and 2 does not apply to perpetual processes, simply because they do not terminate. Starting from the pioneering work of Andreka, van Emden, Nemeti and Tiuryn [1], we discuss in this chapter the basic results of a semantics for perpetual processes.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 J. W. Lloyd
About this chapter
Cite this chapter
Lloyd, J.W. (1984). Perpetual Processes. In: Foundations of Logic Programming. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96826-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-96826-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96828-0
Online ISBN: 978-3-642-96826-6
eBook Packages: Springer Book Archive