Abstract
In this paper we develop a new method for describing in temporal logic in a compositional manner sequential composition, its iterated version (loops) and its interaction with (nested) parallelism. The logic we will use will be a linear time logic with as sole temporal operator the until. We will illustrate this method in the construction of a compositional proof system for a CSP-like language. We will prove this system to be sound and (relative) complete.
(extended abstract)
This research was partially sponsored by Esprit project 415: Parallel Architectures and Languages for AIP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Barringer, R. Kuiper, A. Pnueli (1984). Now you may compose temporal logic specifications, Proc. 16th ACM Symp. on Theory of Computing, pp. 51–63.
H. Barringer, R. Kuiper, A. Pnueli (1986) A really abstract concurrent model and its temporal logic, Proc. 13th ACM Symp. on Principles of Programming Languages, pp. 173–183.
E.W. Dijkstra (1976). A discipline of programming, Prentice Hall.
C.A.R. Hoare (1981). Communicating sequential processes, CACM, Vol. 21, No. 8, pp. 666–677.
D. Harel, D. Kozen, R. Parikh (1980). Process logic: expressiveness, decidability, completeness, 21th Symp. on Foundations of Comp. Sc., Syracus, New York, pp. 129–142.
J. Halpern, Z. Manna, B. Moszkowski (1983). A hardware semantics based on temporal intervals, Automata Languages and Programming, 10th Colloquium, No. 154, pp. 278–291.
L. Lamport (1985). An axiomatic semantics of concurrent programming languages, Logics and Models of Concurrent Systems, edited by K.R. Apt, Springer-Verlag Berlin Heidelberg.
L. Lamport (1980). The Hoare logic of concurrent programs, Acta Informatica, Vol. 14, pp 21–37.
Z. Manna, A. Pnueli (1983). How to cook a temporal proof system for your pet language, Proc. 10th ACM POPL.
V. Nguyen, D. Gries, S. Owicki (1985), A model and temporal proof system for network of processes, 12th ACM Symp. on Principles of Programming, pp. 121–131.
S. Owicki, D. Gries (1976), An axiomatic proof technique for concurrent parallel programs, Acta Informatica, No. 6, pp. 319–340.
A. Prior (1967). Past, present and future, Oxford University Press, London.
A. Pnueli (1977). The temporal logic of programs, 18th IEEE Symp. Foundations of Computer Science, pp.46–57.
A. Tarski (1955), A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math., No. 5, pp. 285–309.
P. Wolper (1981), Temporal logic can be more expressive, 22th Annual Symp. on Foundations of Computer Science, pp. 340–347.
J. Zwiers, W.P. de Roever, P. van Emde Boas (1985). Compositionality and concurrent networks: soundness and completeness of a proof system, Automata, Languages and Programming (ICALP), 12th Colloquium, Napflion, Greece, Vol. 194, pp. 509–519.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S. (1989). Compositionality in the temporal logic of concurrent systems. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_55
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive