Skip to main content
SpringerLink
Log in

A Compositional Axiomatisation of Safety and Liveness Properties for Statecharts

  • Conference paper
Semantics for Concurrency

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Statecharts is a behavioral specification language proposed for specifying large real-time, event driven, reactive systems. It is a graphical language based on state-transition diagrams for finite state machines extended with many features like hierarchy, concurrency, broadcast communication and time-out. By generating external events symbolically, Statecharts can be executed, thereby turning it into a programming language for real-time concurrency (as well as enabling rapid prototyping). As such it is amenable to compositional program verification. We supply Statecharts with a compositional proof system for both safety and liveness properties which we prove to be sound and (relatively) complete. Especially, we focus on extending compositional techniques for proving safety properties to liveness, without immediately adopting temporal logic, since that formalism, elegant as it is, introduces some difficulties with a compositional treatment of sequentiality and looping.

This research was supported by Esprit Project 937 (DESCARTES) and Esprit-BRA project 3096 (SPEC).

The work described here was done while this author was at the Eindhoven University of Technology, partially supported by the Netherlands National Facility for Informatics (NFI).

Present address: Institut für Informatik und Praktische Mathematik II, Christian-AlbrechtsUniversität Kiel, 2300 Kiel 1, Fed. Rep. Germany.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry B, Cosserat L. The synchronous programming language Esterel and its mathematical semantics. Proceedings CMU Seminar on Concurrency, pages 389–349. LNCS 197, Springer-Verlag, 1985.

    Google Scholar 

  2. Bergerand J-L, Caspi P, Halbwachs N. Outline of a real-time data flow language. Proceedings IEEE Real-Time Systems Symposium, 1985.

    Google Scholar 

  3. Bernstein A, Harter (Jr) PK. Proving real-time properties of programs with temporal logic. Proceedings 8th Annual ACM Symposium on Operating System Principles, pages 1–11, 1981.

    Google Scholar 

  4. Barringer H, Kuiper R, Pnueli A. Now you may compose temporal logic specifications. Proceedings 16th Annual ACM Symposium on Theory of Computing, pages 51–63, 1984.

    Google Scholar 

  5. de Bakker J. Mathematical Theory of Program Correctness. Prentice-Hall, 1980.

    Google Scholar 

  6. Drusinsky D, Harel D. On the power of cooperative concurrency. Proceedings of Concurrency 88, pages 74–103. LNCS 335, Springer-Verlag, 1988.

    Google Scholar 

  7. Francez N. Fairness. Springer-Verlag, 1986.

    Google Scholar 

  8. le Guernic P, Benveniste A. Real-time, synchronous, data-flow programming: The language Signal and its mathematical semantics. Technical Report 620, INRIA, Rennes, 1986.

    Google Scholar 

  9. Harel D. First Order Dynamic Logic. LNCS 68, Springer-Verlag, 1979.

    Google Scholar 

  10. Harel D. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8 (3): 231–374, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  11. Harel D. On visual formalisms. Communications of the ACM, 31:514 — 530, 1988.

    Google Scholar 

  12. Huizing C, Gerth R, de Roever WP. Modelling Statecharts behaviour in a fully abstract way. Proceedings 13th Colloquium on Trees in Algebra and Programming, pages 271–394. LNCS 299, Springer-Verlag, 1988.

    Google Scholar 

  13. Hoare CAR. Communicating Sequential Processes. Communications of the ACM, 21 (8): 666–677, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  14. Hoare CAR. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  15. Hooman J. A compositional proof theory for real-time distributed message passing. Parallel Architectures and Languages Europe, pages 315–332. LNCS 259, Springer-Verlag, 1987.

    Google Scholar 

  16. Harel D, Pnueli A, Pruzan-Schmidt J, Sherman R. On the formal semantics of Statecharts. Proceedings IEEE Symposium on Logic in Computer Science, pages 54–64, 1987.

    Google Scholar 

  17. Huizing C, de Roever WP. Everything you always wanted to know about Statecharts but were afraid to ask. Technical Report TIR 90. 3, Eindhoven University of Technology, The Netherlands, 1990.

    Google Scholar 

  18. Hooman J, Ramesh S, de Roever WP. A compositional axiomatisation of Statecharts: Soundness and completeness. Technical Report TIR 89. 2, Eindhoven University of Technology, The Netherlands, 1989.

    Google Scholar 

  19. Hooman J, Widom J. A temporal-logic based compositional proof system for real-time message passing. Parallel Architectures and Languages Europe, volume II, pages 424–341. LNCS 366, Springer-Verlag, 1989.

    Google Scholar 

  20. Jones CB. Tentative steps towards a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5(4):596619, 1983.

    Google Scholar 

  21. Koymans R, Shyamasundar RK, de Roever WP, Gerth R, Arun-Kumar S. Compositional semantics for real-time distributed computing. Information and Computation, 79 (3): 210–356, 1988.

    Article  MathSciNet  Google Scholar 

  22. Lamport L. What Good is Temporal Logic, pages 657–668. Information Processing, R.E. Manson (ed ). North Holland, 1983.

    Google Scholar 

  23. Misra J, Chandy KM. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7 (7): 417–326, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  24. Nguyen V, Demers A, Gries D, Owicki S. A model and temporal proof system for networks of processes. Distributed Computing, 1 (1): 7–35, 1986.

    Article  MATH  Google Scholar 

  25. Shalev M. On the Operational Semantics of Statecharts. M.Sc. thesis, The Weizmann Institute of Science, Rehovot, Israel, 1988.

    Google Scholar 

  26. Staunstrup J, Garland S, Guttag J. Compositional verification of VLSI circuits. Proceedings Workshop On Automatic Verification Methods For Finite State Systems. pages 349–364, LNCS 407, Springer-Verlag, 1989.

    Google Scholar 

  27. Sifakis J (editor). Proceedings Workshop On Automatic Verification Methods For Finite State Systems. LNCS 407, Springer-Verlag, 1989.

    Google Scholar 

  28. Shankar AU, Lam SS. Time-dependent distributed systems: proving safety, liveness and real-time properties. Distributed Computing, 2: 61–79, 1987.

    Article  Google Scholar 

  29. Weihrauch K. Computability, volume 9 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.

    Google Scholar 

  30. Zwiers J, de Roever WP. Predicates are predicate transformers: a unified compositional theory for concurrency. Proceedings 8th ACM Symposium on Principles of Distributed Computing, 1989.

    Google Scholar 

  31. Zwiers J, de Roever WP, van Emde Boas P. Compositionality and concurrent networks: soundness and completeness of a proofsystem. Technical Report 57, University of Nijmegen, The Netherlands, 1984.

    Google Scholar 

  32. Zwiers J. Compositionality, Concurrency and Partial Correctness. LNCS 321, Springer-Verlag, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    J. J. M. Hooman & W. P. de Roever

  2. Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, 400 076, India

    S. Ramesh

Authors
  1. J. J. M. Hooman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Ramesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. P. de Roever
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hooman, J.J.M., Ramesh, S., de Roever, W.P. (1990). A Compositional Axiomatisation of Safety and Liveness Properties for Statecharts. In: Semantics for Concurrency. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3860-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3860-0_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19625-9

  • Online ISBN: 978-1-4471-3860-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation