Relating May and Must Testing Semantics for Discrete Timed Process Algebras

Abstract

In this paper we prove that for timed algebras may testing is much stronger than it could be expected. More exactly, we prove that the may testing semantics is equivalent to the must testing semantics for a rather typical discrete timed process algebra when considering divergence-free processes. This is so, because for any adequate test we can define a dual one in such a way that a process passes the original test in the must sense if and only if it does not pass the dual one in the may sense. It is well known that in the untimed case by may testing we can (partially) know the possible behaviors of a process after the instant at which it diverges, which is not possible under must semantics. This is also the case in the timed case.