Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation

Gerjan Stokkink
(University of Twente)
Mark Timmer
(University of Twente)
Mariëlle Stoelinga
(University of Twente)

The notion of quiescence - the absence of outputs - is vital in both behavioural modelling and testing theory. Although the need for quiescence was already recognised in the 90s, it has only been treated as a second-class citizen thus far. This paper moves quiescence into the foreground and introduces the notion of quiescent transition systems (QTSs): an extension of regular input-output transition systems (IOTSs) in which quiescence is represented explicitly, via quiescent transitions. Four carefully crafted rules on the use of quiescent transitions ensure that our QTSs naturally capture quiescent behaviour.

We present the building blocks for a comprehensive theory on QTSs supporting parallel composition, action hiding and determinisation. In particular, we prove that these operations preserve all the aforementioned rules. Additionally, we provide a way to transform existing IOTSs into QTSs, allowing even IOTSs as input that already contain some quiescent transitions. As an important application, we show how our QTS framework simplifies the fundamental model-based testing theory formalised around ioco.

In Alexander K. Petrenko and Holger Schlingloff: Proceedings 7th Workshop on Model-Based Testing (MBT 2012), Tallinn, Estonia, 25 March 2012, Electronic Proceedings in Theoretical Computer Science 80, pp. 73–87.
Published: 27th February 2012.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: