Advertisement

A Parallel Operator for Real-Time Processes with Predicate Transformer Semantics

  • Karl Lermer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1601)

Abstract

We present a high level specification and refinement framework for concurrent real-time processes with strict message passing based on predicate transformer semantics. Four different parallel operators are defined and we investigate conditions under which they are monotone and associative. Refinement rules for single process components are derived. We also give rules and strategies for the development of a process from an abstract specification to a multi-component specification. This allows the individual refinement of process components under the maintenance of the global process behaviour. A specification and refinement example is included to illustrate the refinement rules.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, 1995.CrossRefGoogle Scholar
  2. 2.
    C. J. Fidge. Refinement rules for real-time multi-tasking programs. In Michael Johnson, editor, Algebraic Methodology and Software Technology (AMAST’97), volume 1349 of Lecture Notes in Computer Science, pages 199–215. Springer-Verlag, December 1997.CrossRefGoogle Scholar
  3. 3.
    C. J. Fidge, I. J. Hayes, A. P. Martin, and A. K. Wabenhorst. A set-theoretic model for real-time specification and reasoning. In J. Jeuring, editor, Mathematics of Program Construction (MPC’98), volume 1422 of Lecture Notes in Computer Science, pages 188–206. Springer-Verlag, 1998.CrossRefGoogle Scholar
  4. 4.
    C. J. Fidge, M. Utting, P. Kearney, and I. J. Hayes. Integrating real-time scheduling theory and program refinement. In M.-C. Gaudel and J. Woodcock, editors, FME’96: Industrial Benefit and Advances in Formal Methods, volume 1051 of Lecture Notes in Computer Science, pages 327–346. Springer-Verlag, 1996.CrossRefGoogle Scholar
  5. 5.
    I. J. Hayes and M. Utting. A sequential real-time refinement calculus. Technical Report 97-33, Software Verification Research Centre, University of Queensland, August 1997. http://svrc.it.uq.edu.au/Publications/Technical_reports_1997.html.Google Scholar
  6. 6.
    I. J. Hayes and M. Utting. Deadlines are termination. In D. Gries and W.-P. de Roever, editors, IFIP International Conference on Programming Concepts and Methods (PROCOMET’ 98), pages 186–204. Chapman and Hall, 1998.Google Scholar
  7. 7.
    C.A.R. Hoare. Communicating sequential processes. Prentice-Hall International, UK, LTD, 1985.zbMATHGoogle Scholar
  8. 8.
    L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, 1994.CrossRefGoogle Scholar
  9. 9.
    B. Mahony. Using the refinement calculus for dataflow processes. Technical Report 94-32, Software Verification Research Centre, University of Queensland, October 1994. http://svrc.it.uq.edu.au/Publications/Technical_reports_1994.html.Google Scholar
  10. 10.
    B. Mahony and I. J. Hayes. A case study in timed refinement: A central heater. In J. M. Morris and R. C. Shaw, editors, Fourth Refinement Workshop, pages 138–149. Springer-Verlag, 1991.Google Scholar
  11. 11.
    B. Mahony, C. Millerchip, and I. J. Hayes. A boiler control system: Overview of a case-study in timed refinement. In D. Del Bel Belluz and H. C. Ratz, editors, Software Safety: Everybody’s Business—Proc. 1993 International Workshop on Design and Review of Software Controlled Safety-Related Systems, pages 189–208, 1994.Google Scholar
  12. 12.
    B. P. Mahony and I. J. Hayes. A case-study in timed refinement: A mine pump. IEEE Transactions on Software Engineering, 18(9):817–826, September 1992.CrossRefGoogle Scholar
  13. 13.
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  14. 14.
    C. Morgan. Data refinement by miracles. In C. Morgan and T. Vickers, editors, On the Refinement Calculus, pages 59–64. Springer-Verlag, 1994.Google Scholar
  15. 15.
    C. Morgan. Programming from Specifications. Prentice-Hall, second edition, 1994.Google Scholar
  16. 16.
    C.C. Morgan and T. Vickers. On the Refinement Calculus. Springer-Verlag, 1994.Google Scholar
  17. 17.
    D. Scholefield. Real-time refinement in Manna and Pnueli’s temporal logic. Formal Aspects of Computing, 8(4):408–427, 1996.CrossRefzbMATHGoogle Scholar
  18. 18.
    M. Utting and C. J. Fidge. Refinement of infeasible real-time programs. In L. Groves and S. Reeves, editors, Formal Methods Pacific’ 97, pages 243–262. Springer-Verlag, 1997.Google Scholar
  19. 19.
    J. von Wright. The lattice of data refinement. Acta Informatica, 31(10):105–135, 1994.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Karl Lermer
    • 1
  1. 1.Software Verification Research CentreThe University of QueenslandAustralia

Personalised recommendations