Skip to main content

Specification and verification of real-time behaviour using Z and RTL

  • Session 7B
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 571))

Abstract

Real-Time Logic is a formal notation for reasoning about temporal behaviour. Z is a general purpose specification language, but lacks explicit features for expressing real-time constraints. We show how these complementary methods can be formally unified. An approach to verification of real-time properties by deriving temporal information directly from the specification is then described.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Abbreviations

ℕ:

The set of natural numbers (non-negative integers)

S :

Powerset: the set of all subsets of S

seq X :

Set of finite or infinite sequences with elements drawn from X

m ... n:

The set of integers between m and n inclusive

〈a,...,s〉:

Sequence of items from a to s

tail S:

Sequence resulting from removal of first element from sequence S

XY:

The set of relations from X to Y

XY:

The set of total functions from X to Y

XY:

The set of partial functions from X to Y

X × Y:

Cartesian product: the set of all ordered pairs from X and Y

f t:

The function f applied to t (left associative)

x R y:

Relation R as an infix operator: (x,y) ε R

R + :

Non-reflexive transitive closure of R.

R −1 :

Inverse of relation R

R(|S|):

Relational image: all elements in R mapped to by elements of S

dom R :

Domain of relation R (or indices of a sequence)

ran R :

Range of relation R (or items in a sequence)

RT:

Range restriction of relation (or sequence) R to T

SR:

Domain subtraction: R less all pairs with first elements from S

RT:

Range subtraction: R less all pairs with second elements from T

SA:

Sequence A restricted to items with indices from S

D ¦ P · t:

The set of t's such that P holds given declarations D

D ¦ P:

The set of D's such that P holds

VD ¦ P · Q:

Universal quantification: for all D's such that P holds, Q holds

DP :

Universal quantification: for all D's P holds

DP :

Existential quantification: there exists D such that P holds

D ¦ P · Q :

There does not exist D such that P and Q hold

DP :

There does not exist D such that P holds

1 DP :

Unique existence: there is one D such that P holds

References

  • BURNS, A. and WELLINGS, A. (1990): Real-Time Systems and their Programming Languages, Addison-Wesley.

    Google Scholar 

  • COOMBES, A. (1990): An Interval Logic for Modelling Time in Z, Technical report, University of York, Dept. Computer Science.

    Google Scholar 

  • DELISLE, N. and GARLAN, D. (1989): Formally Specifying Electronic Instruments, ACM SIGSOFT Eng. Notes, 14(3), pp. 242–248.

    Google Scholar 

  • DILLER, A. (1990): Z: An Introduction to Formal Methods, John Wiley and Sons.

    Google Scholar 

  • DUKE, R. and SMITH, G. (1989): Temporal Logic and Z Specifications, The Australian Computer Journal, 21(2), pp. 62–66.

    Google Scholar 

  • JAHANIAN, F., LEE, R., and MOK, A. (1988): Semantics of Modechart in Real Time Logic, In Shriver, B., editor, Proc. 21st Annual Hawaii International Conference on System Sciences, pp. 479–489.

    Google Scholar 

  • JAHANIAN, F. and MOK, A. (1986): Safety Analysis of Timing Properties in Real-Time Systems, IEEE Transactions on Software Engineering, SE-12(9), pp. 890–904.

    Google Scholar 

  • JAHANIAN, F. and MOK, A. (1987): A Graph-Theoretic Approach for Timing Analysis and its Implementation, IEEE Transactions on Computers, C-36(8), pp. 961–975.

    Google Scholar 

  • JAHANIAN, F. and STUART, D. (1988): A Method for Verifying Properties of Modechart Specifications, Proc. Real-Time Systems Symposium, Alabama, pp. 12–21.

    Google Scholar 

  • King, P. (1989): A Formal Specification of Signalling System Number 7 Link Layer, Technical Report 101, University of Queensland, Key Centre for Software Technology.

    Google Scholar 

  • King, S. (1990): Z and the Refinement Calculus, In Bjorner, D., Hoare, C., and Longmaack, H., editors, Proc. VDM'90, v. 428 Lecture Notes in Computer Science, pp. 164–188. Springer-Verlag.

    Google Scholar 

  • MAHONY, B. and HAYES, I. (1991): Using Continuous Real Functions to Model Timed Histories, Proc. Sixth Australian Software Engineering Conference (ASWEC'91), Sydney.

    Google Scholar 

  • RAYMOND, K., STOCKS, P., and CARRINGTON, D. (1990): Using Z to Specify Distributed Systems, Technical Report 181, The University of Queensland, Key Centre for Software Technology.

    Google Scholar 

  • STUART, D. (1990): Implementing a Verifier for Real-Time Systems, Proc. Real-Time Systems Symposium, Florida, pp. 62–71.

    Google Scholar 

  • ZEDAN, H. (1990): Formal Modelling of Distributed Real-Time Systems, Technical Report YCS 132, University of York, Dept. Computer Science.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan Vytopil

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fidge, C.J. (1991). Specification and verification of real-time behaviour using Z and RTL. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-55092-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55092-1

  • Online ISBN: 978-3-540-46692-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics