research-article

Open access

Real-time refinement in Manna and Pnueli's temporal logic

Author:

David ScholefieldAuthors Info & Claims

Formal Aspects of Computing, Volume 8, Issue 4

Pages 408 - 427

https://doi.org/10.1007/BF01213532

Published: 01 July 1996 Publication History

Abstract

A refinement calculus for the development of real-time systems is presented. The calculus is based upon a wide-spectrum language called TAM (the Temporal Agent Model), within which both functional and timing properties can be expressed in either abstract or concrete terms. A specification oriented semantics is given for the language. Program development is considered as a refinement process i.e. thecalculation of a structured program from an unstructured specification. An example program is developed.

References

References

[1]

Back R. J. R. Correctness Preserving Program Refinements: Proof Theory and Applications Tract 131 1980 Amsterdam Mathematisch Centrum

[2]

Back R. J. R. A Calculus of Refinements for Program Derivations Acta-Informatica 1988 25 593-624

Digital Library

[3]

Barringer, H. “A Survey of Verification Techniques for Parallel Programs”, LNCS 191, Springer-Verlag. 1985.

[4]

Back, R. J. R., von Wright, J. “Refinement Concepts Formalised in Higher-Order Logic”, BCS Formal Aspects of Computing, Vol 2, No. 3. 1990.

[5]

The CIP Language Group, “The Munich Project CIP: Voll”, LNCS 183, Springer-Verlag. 1985.

[6]

Dijkstra, E. “A Discipline of Programming”, Prentice-Hall. 1976.

[7]

Hooman, J. “Specification and Compositional Verification of Real-Time Systems”, Ph.D. Thesis, Technical University of Eindhoven. 1991.

[8]

Koymans, R., deRoever, W. P. “Examples of a Real-Time Temporal Logic Specification”, inThe Analysis of Concurrent Systems, LNCS 207, Springer-Verlag. 1985.

[9]

Morgan, C. “Programming from Specifications”, Prentice-Hall International. 1990.

[10]

Manna, Z., Pnueli, A. “Verification of Concurrent Programs: a Temporal Proof System”, Technical Report, Dept. Computer Science, Stanford University. June 1983.

[11]

Morgan, C., Robinson, K., Gardiner, P. “On The Refinement Calculus”, Oxford University Programming Research Group, Technical Report PRG-70. October 1988.

[12]

Scholefield, D. “A Refinement Calculus for Real-Time Systems”, Department of Computer Science D.Phil. Thesis, University of York. July 1992.

[13]

Schonberg, E., Shields, D. “From Prototype to Efficient Implementation: a Case Study Using SETL and C”, Courant Institute of Mathematical Sciences, Dept. Computer Science, New York University. 1985.

[14]

Scholefield D. J., Zedan H. S. M., and He J. A Specification Oriented Semantics for Real-Time Refinement Theoretical Computer Science 1994 131 219-241

Digital Library

[15]

Chaochen Z., Hoare C. A. R., and Ravn A. P. A Calculus of Durations Information Processing Letters 1991 40 No. 5 269-76

Cited By

Fidge C(2006)Formal change impact analyses for emulated control softwareInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/2990015.32209458:4-5(321-335)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.5555/2990015.3220945
Fidge C(2006)Formal change impact analyses for emulated control softwareInternational Journal on Software Tools for Technology Transfer10.1007/s10009-004-0174-58:4-5(321-335)Online publication date: 9-Feb-2006
https://doi.org/10.1007/s10009-004-0174-5
Fidge C(2003)Verifying Emulation of Legacy Mission Computer SystemsFME 2003: Formal Methods10.1007/978-3-540-45236-2_12(187-207)Online publication date: 25-Sep-2003
https://doi.org/10.1007/978-3-540-45236-2_12
Show More Cited By

Index Terms

Real-time refinement in Manna and Pnueli's temporal logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Constructive linear-time temporal logic: Proof systems and Kripke semantics

In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract
In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can check whether a program in a process algebra, such as Communicating ...
On temporal logic versus datalog
Logic and complexity in computer science

We provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 8, Issue 4

Jul 1996

120 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1996.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1996

Published in FAC Volume 8, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
69
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)25

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fidge C(2006)Formal change impact analyses for emulated control softwareInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/2990015.32209458:4-5(321-335)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.5555/2990015.3220945
Fidge C(2006)Formal change impact analyses for emulated control softwareInternational Journal on Software Tools for Technology Transfer10.1007/s10009-004-0174-58:4-5(321-335)Online publication date: 9-Feb-2006
https://doi.org/10.1007/s10009-004-0174-5
Fidge C(2003)Verifying Emulation of Legacy Mission Computer SystemsFME 2003: Formal Methods10.1007/978-3-540-45236-2_12(187-207)Online publication date: 25-Sep-2003
https://doi.org/10.1007/978-3-540-45236-2_12
Lermer K(1999)A Parallel Operator for Real-Time Processes with Predicate Transformer SemanticsFormal Methods for Real-Time and Probabilistic Systems10.1007/3-540-48778-6_10(152-171)Online publication date: 30-Apr-1999
https://doi.org/10.1007/3-540-48778-6_10

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents