Abstract
Interval Temporal Logic (ITL) was designed as a tool for the specification and verification of systems. The development of an executable subset of ITL, namely Tempura, was an important step in the use of temporal logic as it enables the developer to check, debug and simulate the design. However, a design methodology is missing that transforms an abstract ITL specification to an executable (concrete) Tempura program. The paper describes a development technique for ITL based on refinement calculus. The technique allows the development to proceed from high level “abstract” system specification to low level “concrete” implementation via a series of correctness preserving refinement steps. It also permits a mixture of abstract specification and concrete implementation at any development step.
To allow the development of such a technique, ITL is extended to include modularity, resources and explicit communication. This allows synchronous, asynchronous and shared variable concurrency to be explicitly expressed. These constructs also help in solving the problems, like lack of expressing modularity, timing and communication, discovered during the use of ITL and Tempura for a large-scale application [2].
Funded by EPSRC Research Grant GR/K25922
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.J.R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593–624, 1988
A. Cau, H. Zedan, N. Coleman and B. Moszkowski. Using ITL and Tempura for Large Scale Specification and Simulation, in proc. of fourth euromicro workshop on parallel and distributed processing, IEEE, 1996, Braga, Portugal, 493–500.
A. Cau and B. Moszkowski: Using PVS for Interval Temporal Logic Proofs, Part 1: The Syntactic and Semantic Encoding. Technical Report, 1996.
J. He. A dual-time model for communicating sequential processes. Unpublished manuscript.
R. Milner. A calculus for communicating processes. LNCS 92, 1983.
C. Morgan. Programming from specifications. Prentice-Hall International, 1990.
B. Moszkowski: A Temporal Logic for Multilevel Reasoning About Hardware. IEEE Computer 1985;18:10–19.
B. Moszkowski: Executing Temporal Logic Programs. Cambridge Univ. Press, Cambridge, UK, 1986.
B. Moszkowski. Some very compositional temporal properties, in: Programming Concepts, Methods and Calculi, Ernst-Rüdiger Olderog (ed.), IFIP Transactions, Vol. A-56, North-Holland, 1994, 307–326.
X. Nicolin, J. Richier, J. Sifakis and J. Voiron. ATP: an algebra for timed processes. In Programming Concepts and Methods, M. Broy and C.B. Jones (eds), pp. 414–443, 1990.
D. Scholefield, H. Zedan and J. He. A specification oriented semantics for the refinement of real-time systems. Theoretical Computer Science, 130, August 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cau, A., Zedan, H. (1997). Refining interval temporal logic specifications. In: Bertran, M., Rus, T. (eds) Transformation-Based Reactive Systems Development. ARTS 1997. Lecture Notes in Computer Science, vol 1231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63010-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-63010-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63010-4
Online ISBN: 978-3-540-69058-0
eBook Packages: Springer Book Archive