Relating Alternating Relations for Conformance and Refinement
conference paper
Various relations have been defined to express refinement and conformance for state-transition systems with inputs and outputs, such as and in the area of model-based testing, and alternating simulation and alternating-trace containment originating from game theory and formal verification. Several papers have compared these independently developed relations, but these comparisons make assumptions (e.g., input-enabledness), pose restrictions (e.g., determinism – then they all coincide), use different models (e.g., interface automata and Kripke structures), or do not deal with the concept of quiescence. In this paper, we present the integration of the theory of model-based testing and the theory of alternating refinements, within the domain of non-deterministic, non-input-enabled interface automata. A standing conjecture is that and alternating-trace containment coincide. Our main result is that this conjecture does not hold, but that coincides with a variant of alternating-trace containment, for image finite interface automata and with explicit treatment of quiescence. From the comparison between theory and alternating refinements, we conclude that and the original relation of alternating-trace containment are too strong for realistic black-box scenarios. We present a refinement relation which can express both and refinement in game theory, while being simpler and having a clearer observational interpretation.
TNO Identifier
871936
ISSN
03029743
ISBN
9783030349677
Publisher
Springer
Source title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 15th International Conference on Integrated Formal Methods, IFM 2019, 2 December 2019 through 6 December 2019
Editor(s)
Tarifa, S. ahrendt w.tapia
Pages
246-264
Files
To receive the publication files, please send an e-mail request to TNO Repository.