Abstract
The language CCS σ ,[7], is obtained by adding an extra operator to CCS to detect stability. One application of this operator is in the testing of equivalence of processes. CCS σ arose out of a method of testing which records the refusal of some action in a finite time, as well as successes, [6]. Refusal tests record processes refusing actions and then continuing with other actions. This paper discusses refusal testing and other applications of CCS σ A complete axiomatization is developed for testing equivalence on CCS σ processes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science (34) 1984.
M. Hennessy and T. Regan. A temporal process algebra. Technical report, University of Sussex, 1990.
M. Hennessy and T. Regan. A process algebra for timed systems. Technical report, University of Sussex, 1991.
Sarah Liebert. Ph.d. thesis. forthcoming.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
Iain Phillips. Refusal testing. Theoretical Computer Science, 50, 1987.
Iain Phillips. CCS with broadcast stability. Technical report, Imperial College, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Liebert, S. (1993). A Complete Axiom System for CCS with a Stability Operator. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_17
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_17
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive