Timed circus: Timed CSP with the miracle

Kun Wei*, Jim Woodcock, Alan Burns

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Timed Circus is a compact extension to Circus; that is, it inherits only the CSP part of Circus while introducing time. Although it looks much like timed CSP from the viewpoint of syntax, its semantics is very different from that of timed CSP because it uses a complete lattice in the implication ordering instead of the complete partial order of the standard failures-divergences model of CSP. The complete lattice gives rise to a number of strange processes which violate some axioms of CSP, especially when the miracle (the top element) and SKIP meet time. In this paper, compared with timed CSP, we will extensively explore such strange processes which turn out to be very useful in specifying a distinct property that 'something must occur'. Finally, we use a simple example to demonstrate how our model can contribute to modelling temporal behaviours with multiple time scales in complex systems.

Original languageEnglish
Title of host publication16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011, Las Vegas, Nevada, USA, 27-29 April 2011
EditorsIsabelle Perseil, Karin Breitman, Roy Sterritt
PublisherIEEE Computer Society
Pages55-64
Number of pages10
ISBN (Electronic)9780769543819
ISBN (Print)9781612848532
DOIs
Publication statusPublished - 25 Jul 2011
Event16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011 - Las Vegas, NV, United Kingdom
Duration: 27 Apr 201129 Apr 2011

Conference

Conference16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011
Country/TerritoryUnited Kingdom
CityLas Vegas, NV
Period27/04/1129/04/11

Cite this