Abstract
We investigate the notion of fair testing, a formal testing theory in the style of De Nicola and Hennessy, where divergences are disregarded as long as there are visible outgoing transitions. The usual testing theories, such as the standard model of failure pre-order, do not allow such fair interpretations because of the way in which they ensure their compositionality with respect to abstraction from observable actions. This feature is usually present in the form of a hiding-operator (CSP, ACP, LOTOS) or part of parallel composition (CCS). Its application can introduce new divergences causing semantic complications. In this paper we present a testing scenario that captures the intended notion of fairness and induces a pre-congruence for abstraction.In the presence of a sufficiently strong synchronisation feature it is shown to be the coarsest pre-congruence contained in the (non-congruent) fair version of failure preorder. We also give a denotational characterisation.
Partially supported by the Esprit BRA 6021 ‘REACT’
Partially supported by the HCM network ‘EXPRESS’
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Comput. Sci., 53(3):225–241, 1987.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Univ. Press 1990.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M. Wirsing, ed., Formal Description of Programming Concepts — III, pp. 77–103. IFIP, Elsevier, 1987.
E. Brinksma. A theory for the derivation of tests. In Aggarwal and Sabnani, eds., Protocol Specification, Testing, and Verification VIII, pp. 63–74. Elsevier, 1988.
E. Brinksma. Cache consistency by design. In Vuong and Chanson [24], pp. 53–67.
S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560–599, July 1984.
S. D. Brookes and A. W. Roscoe. An improved failures model for communicating processes. In Brookes, Roscoe and Winskel, eds., Seminar on Concurrency, vol. 197 of LNCS, pp. 281–305. Springer, 1985.
R. De Nicola. Extensional equivalences for transition systems. Acta Inf., 24:211–237, 1987.
R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34:83–133, 1984.
R. J. van Glabbeek. The linear time — branching time spectrum II: The semantics of sequential systems with silent moves. In Best, ed., Concur '93, vol. 715 of LNCS, pp. 66–81. Springer, 1993. Extended abstract.
J. F. Groote. Implementation of events in LOTOS-specifications. Master's thesis, University of Twente, 1998. Technical Report, Philips CAM Centre C.F.T.
M. Hennessy. Acceptance trees. J. ACM, 32(4):896–928, Oct. 1985.
M. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theoretical Comput. Sci., 49:121–143, 1987.
M. Hennessy. Algebraic Theory of Processes. Foundations of Computing Series. MIT Press, Boston, 1988.
R. Langerak. A testing theory for LOTOS using deadlock detection. In Brinksma, Scollo and Vissers, eds., Protocol Specification, Testing and Verification IX, pp. 87–98. North-Holland 1989.
K. G. Larsen and R. Milner. Verifying a protocol using relativized bisimulation. In T. Ottman, ed., Automata, Languages and Programming, vol. 267 of LNCS, pp. 126–135. Springer, 1987.
G. Leduc. Failure-based congruences, unfair divergences, and new testing theory. In Vuong and Chanson [24].
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
V. Natarajan and R. Cleaveland. Divergence and fair testing. To be published in the proceedings of ICALP '95, 1995.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen, ed., Proc. 5th GI Conference, vol. 104 of LNCS, pp. 167–183. Springer, 1981.
I. Phillips. Refusal testing. Theoretical Comput. Sci., 50(2):241–284, 1987.
A. Valmari. The weakest deadlock-preserving congruence, 1995. To appear in Information Processing Letters.
W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets, vol. 625 of LNCS. Springer, 1992.
S. Vuong and S. Chanson, eds. Protocol Specification, Testing, and Verification, XIV, IFIP Series. Chapman & Hall, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brinksma, E., Rensink, A., Vogler, W. (1995). Fair testing. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-60218-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60218-7
Online ISBN: 978-3-540-44738-2
eBook Packages: Springer Book Archive