Learn More
A new model based testing theory built on simulation semantics is presented. At the core of this theory there is an input-output conformance simulation relation (iocos). As a branching semantics iocos can naturally distinguish the context of local choices. We show iocos to be a finer relation than the classic ioco conformance relation. It turns out that(More)
In this paper we study the extension of classical testing theory to a probabilistic process algebra. We consider a generative interpretation of probabilities for a language with two choice operators (one internal and the other external), which are annotated with a probability p 2 (0; 1). We deene a testing semantics for our language, and we write P passp T(More)
In this paper we present a probabilistic-timed process algebra , which tries to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we deene a testing semantics based on the probability with which processes pass tests. Af-terwards the(More)
There are several methods to assess the capability of a test suite to detect faults in a potentially wrong system. We explore two methods based on considering some probabilistic information. In the first one, we assume that we are provided with a probabilistic user model. This is a model denoting the probability that the entity interacting with the system(More)
EXercita is a system designed to archive and publish programming exercises. It consists of a repository of structured documents, each describing an exercise, and several tools to manage it. Documents are marked-up with an extension of LaTeX we have designed, called eXercita, and can be automatically published as PostScript files or Web pages. In addition,(More)
In this paper we develop a general framework to reason about testing. The difficulty of testing is assessed in terms of the amount of tests that must be applied to determine whether the system is correct or not. Based on this criterion, five testability classes are presented and related. We also explore conditions that enable and disable finite testability,(More)