Abstract
Restricted views of process behaviour result in a form of abstraction which is useful in the construction of specifications involving fault-tolerance and atomicity. This paper presents an operational characterisation of abstraction for refusable and non-refusable events in terms of testing. This view is related to standard notions of testing, and is given a new denotational characterisation encapsulated within the CSP denotational semantics. It informs, reinforces and extends the traditional denotational approach to abstraction.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J Davies, D Jackson, and S Schneider. Making things happen in Timed CSP. In Formal Techniques for Real-Time and Fault-Tolerant Systems, volume 573 of Lecture Notes in Computer Science. Springer Verlag, 1992.
R de Nicola and M Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1), 1984.
M Goldsmith and J Hulance. Application of CSP and FDR to safety-critical systems: Investigation of refinement properties of fault tolerance and prototype implementation of analysis techniques. DERA project report, 1997.
M Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
A W Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
A W Roscoe, J C P Woodcock, and L Wulf. Non-interference through determinism. In European Symposium on Research in Computer Security, volume 875 of Lecture Notes in Computer Science. Springer Verlag, 1994.
S A Schneider. Abstraction and testing. Technical Report TR-99-02, Royal Holloway, 1999.
S A Schneider. Concurrent and real-time systems: the CSP approach. John Wiley, 1999. to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schneider, S. (1999). Abstraction and Testing. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48119-2_41
Download citation
DOI: https://doi.org/10.1007/3-540-48119-2_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66587-8
Online ISBN: 978-3-540-48119-5
eBook Packages: Springer Book Archive