Results 1 
3 of
3
Fair testing
 Concur ’95: Concurrency Theory, volume 962 of Lecture Notes in Computer Science
, 1995
"... In this paper we present a solution to the longstanding problem of characterising the coarsest livenesspreserving precongruence with respect to a full (TCSPinspired) process algebra. In fact, we present two distinct characterisations, which give rise to the same relation: an operational one base ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
(Show Context)
In this paper we present a solution to the longstanding problem of characterising the coarsest livenesspreserving precongruence with respect to a full (TCSPinspired) process algebra. In fact, we present two distinct characterisations, which give rise to the same relation: an operational one based on a De NicolaHennessylike testing modality which we call shouldtesting, and a denotational one based on a refined notion of failures. One of the distinguishing characteristics of the shouldtesting precongruence is that it abstracts from divergences in the same way as Milner’s observation congruence, and as a consequence is strictly coarser than observation congruence. In other words, shouldtesting has a builtin fairness assumption. This is in itself a property long soughtafter; it is in notable contrast to the wellknown musttesting of De Nicola and Hennessy (denotationally characterised by a combination of failures and divergences), which treats divergence as catrastrophic and hence is incompatible with observation congruence. Due to these characteristics, shouldtesting supports modular reasoning and allows to use the proof techniques of observation congruence, but also supports additional laws and techniques.
A Semantic Theory for Heterogeneous System Design
 In FSTTCS 2000, vol. 1974 of LNCS
, 2000
"... This paper extends DeNicola and Hennessy's testing theory from labeled transition system to Büchi processes and establishes a tight connection between the resulting Büchi mustpreorder and satisfaction of lineartime temporal logic (LTL) formulas. An example dealing with the design of a communi ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
This paper extends DeNicola and Hennessy's testing theory from labeled transition system to Büchi processes and establishes a tight connection between the resulting Büchi mustpreorder and satisfaction of lineartime temporal logic (LTL) formulas. An example dealing with the design of a communications protocol testi es to the utility of the theory for heterogeneous system design, in which some components are specified as labeled transition systems and others are given as LTL formulas.
Fair Testing Through Probabilistic Testing
, 1999
"... In this paper we define a probabilistic testing semantics which can be used to alternatively characterize fair testing. The key idea is to define a probabilistic semantics in such a way that two nonprobabilistic processes are fair equivalent iff any probabilistic version of both processes are equiv ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we define a probabilistic testing semantics which can be used to alternatively characterize fair testing. The key idea is to define a probabilistic semantics in such a way that two nonprobabilistic processes are fair equivalent iff any probabilistic version of both processes are equivalent in our probabilistic testing semantics. In order to get this result we define a simple probabilistic must semantics by saying that a probabilistic process must pass a test iff the probability with which the process passes the test equals 1. Finally, we present an algorithm for deciding whether the probability with which a finitestate process passes a finitestate test equals 1. Alternatively, this algorithm can be used for computing whether a finitestate process fairly passes a finitestate test. Keywords: Testing semantics, fair testing, probabilistic processes. 1. INTRODUCTION Formal models of concurrency have been proved to be very useful to properly specify concurrent and distr...