Brinksma, Ed and Rensink, Arend and Vogler, Walter (1995) Fair Testing. In: 6th International Conference on Concurrency Theory, CONCUR 1995, August 21–24, 1995 , Philadelphia, PA, USA (pp. pp. 313-327).
|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.
|Item Type:||Conference or Workshop Item|
|Copyright:||© 2011 Springer|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/66651|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page