Skip to main navigation Skip to search Skip to main content

On the complexity of input output conformance testing

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

308 Downloads (Pure)

Abstract

Input-output conformance (ioco) testing is a well-known approach to model-based testing. In this paper, we study the complexity of checking ioco. We show that the problem of checking ioco is PSPACE-complete. To provide a more efficient algorithm, we propose a more restricted setting for checking ioco, namely with deterministic models and show that in this restricted setting ioco checking can be performed in polynomial time.
Original languageEnglish
Title of host publicationFormal Aspects of Component Software (10th International Symposium, FACS 2013, Nanchang, China, October 27-29, 2013, Revised Selected Papers)
EditorsJ.L. Fiadeiro, Z. Liu, J. Xue
Place of PublicationBerlin
PublisherSpringer
Pages291-309
ISBN (Print)978-3-319-07601-0
DOIs
Publication statusPublished - 2014
Event10th International Symposium on Formal Aspects of Component Software (FACS 2013), October 27-29, 2013, Nanchang, China - Nanchang, China
Duration: 27 Oct 201329 Oct 2013

Publication series

NameLecture Notes in Computer Science
Volume8348
ISSN (Print)0302-9743

Conference

Conference10th International Symposium on Formal Aspects of Component Software (FACS 2013), October 27-29, 2013, Nanchang, China
Abbreviated titleFACS 2013
Country/TerritoryChina
CityNanchang
Period27/10/1329/10/13

Fingerprint

Dive into the research topics of 'On the complexity of input output conformance testing'. Together they form a unique fingerprint.

Cite this