Abstract
Temporal logic investigated in the previous part represents program execution by taking trace semantics into account. The traces are represented by the changes of local variables. The computational paths are realized according to the time structure of the temporal logic. Note that for a given program p the set Trace A . 〚p〛 of traces in a given model A, when the input is fixed, forms a tree. Depending on the time structure this tree can be represented in different ways. We considered a time structure which allowed us to represent Trace A . 〚p〛 as the set of all possible paths from the root (given input) to the leaves (outputs) of the tree. It is important to emphasize that temporal logic uses a fixed linear time structure built into the Kripke models.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gergely, T., Úry, L. (1991). Introduction to Part IV. In: First-Order Programming Theories. EATCS Monographs on Theoretical Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58205-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-58205-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63503-8
Online ISBN: 978-3-642-58205-9
eBook Packages: Springer Book Archive