Timed Testing of Concurrent Systems

We are concerned with timing considerations for concurrent systems where the time needed by the individual actions is not known beforehand; it has long been suspected that partial order semantics is useful here. We develop a suitable testing scenario to study this idea. With some view of timed behaviour, we can confirm that interval semiword semantics, a special partial order semantics, is indeed useful. With another view, our testing scenario leads to timed-refusal-trace semantics, where no relation to partial order semantics is obvious.