%0 Book Section
%T Testing finite state machines presenting stochastic time and timeouts
publisher SPRINGER-VERLAG BERLIN
%D 2007
%U 978-3-540-75210-3
%@ https://hdl.handle.net/20.500.14352/53132
%X In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [10]. In fact, the current paper together with [10] constitute a complete formal theory to specify and test the class of systems covered by the before mentioned stochastic finite state machines.
%~