Abstract
We address the hierarchical (vertical) decomposition, or abstract implementation, of object specification in temporal logic. Whereas previous approaches to refinement in the context of temporal logic such as those developed by Lamport and by Barringer, Kuiper and Pnueli are based on a single logic that accommodates different levels of action granularity, our approach is based on relating different logics corresponding to different levels of granularity. More precisely, we map abstract actions (propositions) to concrete objects (theories) and, through inference rules that relate the different logics, derive properties of the abstracted actions from the behaviour of the corresponding objects. In this way, we keep a tighter control of action granularity and interference, enabling us to maintain the use of the “next” operator and make the development of reactive systems more tractable.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.Aceto and M.Hennessy, “Towards Action Refinement in Process Algebras”, in Proc. 4th LICS, IEEE 1989, 138–145
R.Back and R.Kurki-Suonio, “Distributed Cooperation with Action Systems”, ACM TOPLAS 10, 1988, 513–554
H.Barringer and R.Kuiper, “Hierarchical Development of Concurrent Systems in a Temporal Framework”, in S.Brookes, A.Roscoe and G.Winskel (eds) Seminar on Concurrency, LNCS 197, Springer-Verlag 1984, 35–61
H.Barringer, R.Kuiper and A.Pnueli, “A Really Abstract Concurrent Model and its Temporal Logic”, in Proc. 13th ACM Symposium on Principles of Programming Languages, ACM 1986, 173–183
G.Boudol, Atomic Actions, Research Notes, INRIA Sophia Antipolis, 1991
G. Boudol and I. Castellani, “Concurrency and Atomicity”, Theoretical Computer Science 59, 1988, 25–84
K.M.Chandy and J.Misra, Parallel Program Design — A Foundation, Addison Wesley 1988
J.F.Costa, A.Sernadas and C.Sernadas, Inductive Objects, Research Report, DMIST/INESC July 1992
H.-D.Ehrich and A.Sernadas, “Algebraic Implementation of Objects over Objects”, in Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, J. de Bakker, W.-P. de Roever and G. Rozenberg (eds), Springer Verlag, 1990, 239–266.
J.Fiadeiro and T.Maibaum, “Temporal Theories as Modularisation Units for Concurrent System Specification”, Formal Aspects of Computing 4(3), 1992, 239–272
J.Fiadeiro and T.Maibaum, Verifying for Reuse, Technical Report,FCUL, 1993
C.Jones, An Object-Based Design Method for Concurrent Programs, Technical Report, University of Manchester, 1992
L. Lamport, “Specifying Concurrent Program Modules”, ACM TOPLAS 6(2), 1983
L.Lamport, “A Simple Approach to Specifying Concurrent Systems”, Communications ACM 32(1), 1989,32–45
C.Sernadas, P.Gouveia, J.Gouveia, A.Sernadas and P.Resende, “The Reification Dimension in Object-oriented Data Base Design”, in Specification of Data Base Systems, D. Harper and M. Norrie (eds), Springer Verlag, 1992, 275–299
P.Veloso, T.Maibaum and M.Sadler, “Program Development and Theory Manipulation”, Proc. Third International Workshop on Software Specification and Design, London, IEEE Computer Society Press 1985, 228–232.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiadeiro, J.L., Maibaum, T. (1994). Sometimes “Tomorrow” is “Sometime”. In: Gabbay, D.M., Ohlbach, H.J. (eds) Temporal Logic. ICTL 1994. Lecture Notes in Computer Science, vol 827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013980
Download citation
DOI: https://doi.org/10.1007/BFb0013980
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58241-0
Online ISBN: 978-3-540-48585-8
eBook Packages: Springer Book Archive