Cavalcanti, Ana L. C., Sampaio, Augusto C.A., Woodcock, Jim (2002) Refinement of Actions in Circus. In: Proceedings of REFINE'2002. Electronic Notes in Theoretical Computer Science , 70. pp. 132-162. Elsevier (doi:10.1016/S1571-0661(05)80489-X) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13674)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1016/S1571-0661(05)80489-X |
Abstract
This paper presents refinement laws to support the development of actions in Circus, a combination of Z and CSP adequate to specify the data structures and behavioural aspects of concurrent systems. In this language, systems are characterised as a set of processes; each process is a unit that encapsulates state and reactive behaviour defhed by actions. Previously, we have addressed the issue of refining processes. Here, we are concerned with the actions that compose the behaviour of such processes, and that may involve both Z and CSP constructs. We present a number of useful laws, and a case study that illustrates their application.
Item Type: | Conference or workshop item (Paper) |
---|---|
DOI/Identification number: | 10.1016/S1571-0661(05)80489-X |
Additional information: | Invited Paper |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:59 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13674 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):