Paper Details

%T Successful Termination in Timed CSP
%A Paul Howells, Mark d'Inverno
%E Peter H. Welch, Frederick R. M. Barnes, Jan F. Broenink, Kevin Chalmers, Jan Bækgaard Pedersen, Adam T. Sampson
%B Communicating Process Architectures 2013
%X In previous work the authors investigated the
   inconsistencies of how successful termination was modelled
   in Hoare, Brookes and Roscoe\[rs]s original CSP. This led
   to the definition of a variant of CSP, called CSPt. CSPt
   presents a solution to these problems by means of adding
   a termination axiom to the original process axioms. In this
   paper we investigate how successful process termination is
   modelled in Reed and Roscoe\[rs]s Timed CSP, which is the
   temporal version of Hoare\[rs]s original untimed CSP. We
   discuss the issues that need to be considered when selecting
   termination axioms for Timed CSP, based on our
   experiences in defining CSPt. The outcome of this
   investigation and discussion is a collection of candidate
   successful termination axioms that could be added to the
   existing Timed CSP models, leading to an improved treatment
   of successful termination within the Timed CSP framework. We
   outline how these termination axioms would be added to the
   family of semantic models for Timed CSP. Finally, we
   outline what further work needs to be done once these new
   models for Timed CSP have been defined. For example, it
   would then be possible to define timed versions of the new
   more flexible parallel operators introduced in CSPt.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.