Abstract
This paper presents a formal specification and hierarchic development method for concurrent systems. The approach is based on a temporal logic to enable the specification of both safety and liveness properties in a single uniform framework. Two main problems are addressed, firstly, the reconciliation of temporal logic and compositionality in a structured specification approach, and secondly, to possess natural and easy to use proof rules for justifying parallel decomposition steps. To solve the first, we use a simple modification to the usual temporal logic model; to solve the second, we advocate the use of past time temporal operators in a new systematic and structured style for writing specifications.
Preview
Unable to display preview. Download preview PDF.
References
P.Aczel On an Inference Rule for Parallel Composition Internal Memo Department of Mathematics, University of Manchester, 1983.
H.Barringer and R.Kuiper Towards the Hierarchical, Temporal Logic, Specification of Concurrent Systems Proc. of the STL/SERC Workshop on the Analysis of Concurrent Systems Cambridge, September 1983.
H.Barringer, R.Kuiper and A.Pnueli Now You May Compose Temporal Logic Specifications Proc. of the 16th ACM Symposium on the Theory of Computing Washington, May 1984.
H.Barringer, R.Kuiper and A.Pnueli A Compositional Temporal Approach to a CSP-like Language Internal Report Department of Computer Science, University of Manchester, Oct. 1984.
G.D.Gough Decision Procedures for Temporal Logic M.Sc. Dissertation Department of Computer Science, University of Manchester, Oct. 1984.
B.T. Hailpern and S.S. Owicki Modular Verification of Computer Communication Protocols IEEE Trans. on Commun. COM-31, 1, Jan. 1983, pp56–68.
C.A.R. Hoare A Calculus of Total Correctness for Communicating Processes Science of Computer Programming, 1, 1981, pp49–72.
C.B. Jones Specification and Design of (Parallel) Programs Proc. IFIP 83, Paris, North Holland, 1983, pp321–332.
L. Lamport Specifying Concurrent Program Modules ACM TOPLAS, Apr 1983, Vol. 5, No. 2, 1983, pp190–222.
G.M. Levin and D. Gries A Proof Technique for Communicating Sequential Processes Acta Informatica 15, 1981, pp281–302.
J.Misra and K.M.Chandy Proofs about Networks of Processes IEEE TOSE Vol SE-7, No. 4, July 1981.
J.Misra, K.M.Chandy and T.Smith Proving Safety and Liveness of Communicating Processes with Examples Proc. 1st ACM SIGACP/SIGOPS Symp. on PODC, Ottawa, Aug. 1982.
Z. Manna and A. Pnueli Verification of Concurrent Programs: The Temporal Framework in “The Correctness Problem in Computer Science” ed. R.S. Boyer and J.S. Moore International Lecture Notes in Computer Science, pp215–273 Academic Press, London, 1982.
Z.Manna and A.Pnueli Verification of Concurrent Programs: A Temporal Proof System Computer Science Report, Stanford University, 1983.
S.S. Owicki and D. Gries An Axiomatic Proof Technique for Parallel Programs 1 Acta Informatica, 6, 1976, pp319–340.
S.S. Owicki and L. Lamport Proving Liveness Properties of Concurrent Programs ACM TOPLAS, Vol. 4, No. 3, July 1982, pp455–495.
The Temporal Semantics of Concurrent Computation Proc. of the Symp. on Semantics of Concurrent Computation Evian, France, July 1979 Springer-Verlag, LNCS Vol. 70, pp1–20.
A.Prior Past, Present and Future Oxford University Press, 1967.
A.P.Sistla, E.M.Clarke, N.Francez and Y.Gurevich Can Buffers be Specified in Linear Temporal Logic? Proc. 1st ACM SIGACP/SICOPS Symp. on PODC, Ottawa, Aug. 1982.
Sa Jin Temporal Logic Specification of Communication Protocols Ph.D. Transfer Report Department of Computer Science, University of Manchester, Sep. 1984.
P.Wolper Temporal Logic can be more Expressive Proc. of the 22nd Symp. on FOCS, Oct. 1981.
Zhou Chao Chen and C.A.R.Hoare Partial Correctness of Communicating Processes and Protocols Proc. of 2nd Int. Conf. on Distributed Computing Systems, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Barringer, H., Kuiper, R. (1985). Hierarchical development of concurrent systems in a temporal logic framework. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-15670-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15670-3
Online ISBN: 978-3-540-39593-5
eBook Packages: Springer Book Archive