Towards Algebraic Semantics of Circus Time | SpringerLink
Skip to main content

Towards Algebraic Semantics of Circus Time

  • Conference paper
  • First Online:
Unifying Theories of Programming (UTP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8963))

Included in the following conference series:

  • 376 Accesses

Abstract

Over the years, the Circus family of notation has been used for specification, programming, and verification by refinement in many applications. Circus Time, a timed variant of Circus, plays a key role in dealing with timed behaviours. While most of the semantic developments of Circus Time have tended to focus on the denotational and operational sides, the work on its algebraic semantics is frustrated by the fact that the parallel operators are difficult to be reduced to other primitives in both discrete-time and continuous-time CSP models. In this paper, we present an algebraic operational semantics (AOS) of the discrete-time CSP in Circus Time. The related AOS form is identified in the timed context, and a complete set of algebraic laws are provided to transform any finite Circus Time programs into the AOS form. The AOS provides a solution to sequentialise the parallel operators and is also the major step towards a fully algebraic semantics.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 4576
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 5720
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Roscoe, A.W.: Model-checking CSP. In: A Classical Mind: essays in Honour of C.A.R. Hoare, ch. 21. Prentice-Hall (1994)

    Google Scholar 

  2. Cavalcanti, A., Clayton, P., O’Halloran, C.: From control law diagrams to ada via circus. Formal Asp. Comput. 23(4), 465–512 (2011)

    Article  MATH  Google Scholar 

  3. Cavalcanti, A., Sampaio, A., Woodcock, J.: A Refinement Strategy for Circus. Formal Aspects of Computing 15(2–3), 146–181 (2003)

    Article  MATH  Google Scholar 

  4. Cavalcanti, A., Zeyda, F., Wellings, A.J., Woodcock, J., Wei, K.: Safety-critical java programs from circus models. Real-Time Systems 49(5), 614–667 (2013)

    Article  MATH  Google Scholar 

  5. Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: Unifying Classes and Processes. Software and System Modelling 4(3), 277–296 (2005)

    Article  Google Scholar 

  6. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall International (1985)

    Google Scholar 

  7. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall International (1998)

    Google Scholar 

  8. Lowe, G., Ouaknine, J.: On timed models and full abstraction. Electron. Notes Theor. Comput. Sci. 155, 497–519 (2006)

    Article  Google Scholar 

  9. Miyazawa, A., Cavalcanti, A.: Refinement-based verification of sequential implementations of stateflow charts. In: Refine, pp. 65–83 (2011)

    Google Scholar 

  10. Morgan, C.: Programming from specifications. Prentice-Hall Inc., Upper Saddle River (1990)

    MATH  Google Scholar 

  11. Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP Semantics for Circus. Formal Aspects of Computing 21(1), 3–32 (2007)

    MathSciNet  Google Scholar 

  12. Ouaknine, J.: Discrete analysis of continuous behaviour in real-time concurrent systems. PhD thesis, Oxford University, UK (2001)

    Google Scholar 

  13. Ouaknine, J., Schneider, S.: Timed csp: A retrospective. Electr. Notes Theor. Comput. Sci. 162, 273–276 (2006)

    Article  Google Scholar 

  14. Roscoe, A.: Understanding Concurrent Systems, 1st edn. Springer-Verlag New York Inc., New York (2010)

    Book  MATH  Google Scholar 

  15. Roscoe, A.W.:. The Theory and Practice of Concurrency. Prentice-Hall International (1998)

    Google Scholar 

  16. Schneider, S.A.: Concurrent and real-time systems: the CSP approach. John Wiley & Sons (1999)

    Google Scholar 

  17. Sherif, A., Cavalcanti, A.L.C., Jifeng, H., Sampaio, A.C.A.: A process algebraic framework for specification and validation of real-time systems. Formal Aspects of Computing 22(2), 153–191 (2010)

    Article  MATH  Google Scholar 

  18. Wei, K., Woodcock, J., Burns, A.: A timed model of Circus with the reactive design miracle. In: 8th International Conference on Software Engineering and Formal Methods (SEFM), pp. 315–319. IEEE Computer Society, Pisa (2010)

    Google Scholar 

  19. Wei, K., Woodcock, J., Burns, A.: Modelling temporal behaviour in complex systems with timebands. Formal Methods in System Design 43(3), 520–551 (2013)

    Article  MATH  Google Scholar 

  20. Wei, K., Woodcock, J., Cavalcanti, A.: Circus Time with reactive designs. In: UTP, pp. 68–87 (2012)

    Google Scholar 

  21. Wei, K., Woodcock, J., Cavalcanti, A.: New Circus Time. Technical report, Computer Science, University of York, UK (2012). http://www.cs.york.ac.uk/circus/hijac/publication.html

  22. Wei, K., Woodcock, J., Cavalcanti, A.: Operational Semantics for Circus Time. Technical report, Computer Science, University of York, UK (2013). http://www.cs.york.ac.uk/circus/hijac/publication.html

  23. Woodcock, J., Cavalcanti, A., Fitzgerald, J.S., Larsen, P.G., Miyazawa, A., Perry, S.: Features of cml: A formal modelling language for systems of systems. In: SoSE, pp. 445–450. IEEE (2012)

    Google Scholar 

  24. Woodcock, J., Davies, J.: Using Z: Specification, Refinement and Proof. Prentice-Hall Inc., Upper Saddle River (1996)

    MATH  Google Scholar 

  25. Woodcock, J.C.P., Cavalcanti, A.L.C.: A concurrent language for refinement. In: Butterfield, A., Pahl, C. (eds.) IWFM 2001: 5th Irish Workshop in Formal Methods. BCS Electronic Workshops in Computing, Dublin, Ireland (July 2001)

    Google Scholar 

  26. Woodcock, J., Cavalcanti, A.: The semantics of circus. In: Bert, D., Bowen, J.P., C. Henson, M., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, p. 184. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jim Woodcock .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wei, K., Woodcock, J. (2015). Towards Algebraic Semantics of Circus Time . In: Naumann, D. (eds) Unifying Theories of Programming. UTP 2014. Lecture Notes in Computer Science(), vol 8963. Springer, Cham. https://doi.org/10.1007/978-3-319-14806-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14806-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14805-2

  • Online ISBN: 978-3-319-14806-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics