Back to Search
Start Over
Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation
- Source :
- Electronic Proceedings in Theoretical Computer Science, Vol 80, Iss Proc. MBT 2012, Pp 73-87 (2012)
- Publication Year :
- 2012
- Publisher :
- Open Publishing Association, 2012.
-
Abstract
- 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.
- Subjects :
- Mathematics
QA1-939
Electronic computers. Computer science
QA75.5-76.95
Subjects
Details
- Language :
- English
- ISSN :
- 20752180
- Volume :
- 80
- Issue :
- Proc. MBT 2012
- Database :
- Directory of Open Access Journals
- Journal :
- Electronic Proceedings in Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.b51704ad9ac43d48d1f135e8f9170ac
- Document Type :
- article
- Full Text :
- https://doi.org/10.4204/EPTCS.80.6