2014
DOI: 10.1007/978-3-319-07602-7_18
|View full text |Cite
|
Sign up to set email alerts
|

On the Complexity of Input Output Conformance Testing

Abstract: 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 PSPACEcomplete. 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…This work was extended in [5], where the input-enabledness requirement was dropped by introducing a composition with pruning. The quotient operation in the ioco-testing theory was proposed in [11]. In contrast to this paper, the proposed solution is incomplete and may not find the quotient even when it exists.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…This work was extended in [5], where the input-enabledness requirement was dropped by introducing a composition with pruning. The quotient operation in the ioco-testing theory was proposed in [11]. In contrast to this paper, the proposed solution is incomplete and may not find the quotient even when it exists.…”
Section: Related Workmentioning
confidence: 99%
“…We provide more flexibility by separating parallel composition from hiding. Finally, there is an assumption in [11] that the output alphabet of the known component specification not shared with the alphabet of the overall system specification must be used for the synchronization with the quotient. In contrast, we provide more flexibility by allowing specifying beforehand the input alphabet of the quotient, thus allowing more control over synchronization between the quotient and the known component.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Noroozi et al [17] presented a polynomial time reduction from a variation of the SAT problem to the problem of checking ioco-completeness, thus establishing that, under very general assumptions about the IOLTS models -including non-determinism, -that checking ioco-completeness is a PSPACE-complete problem. In a more restricted scenario, treating only deterministic and input-enabled IOLTS models, they proposed a polynomial time algorithm, based on a simulation-like preorder relation.…”
Section: Related Workmentioning
confidence: 99%