A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Testing Input/Output Partial Order Automata
[chapter]

2007
*
Lecture Notes in Computer Science
*

We propose an extension of the Finite State Machine framework in distributed systems, using

doi:10.1007/978-3-540-73066-8_12
fatcat:fnaekvhiu5ecjpvoe7cdnbtdp4
*input*/*output**partial**order**automata*(IOPOA). ... We develop the formal framework for distributed*testing*in this architecture and compare with the synchronous I/O automaton setting. ... IOPO*Automata*Definition 1. An*Input*/*Output**Partial**Order*Automaton (or IOPO Automaton, IOPOA) is a tuple M = (S, s in , Chn, I, O, δ, λ, ω), where 1. ...##
###
Testing Systems Specified as Partial Order Input/Output Automata
[chapter]

2008
*
Lecture Notes in Computer Science
*

In this paper, we generalize this model to

doi:10.1007/978-3-540-68524-1_13
fatcat:354minj7rjclhkjjphrueq5f24
*Partial**Order**Input*/*Output**Automata*(POIOA), in which each transition is associated with an almost arbitrary*partially**ordered*set of inputs and outputs. ... An*Input*/*Output*Automaton is an automaton with a finite number of states where each transition is associated with a single inpuf or output interaction. ... (c) An*Input*/*Output**Automata*model equivalent to the POIOA transition shown in (a) Definition 2 : 2 A*Partial**Order**Input*/*Output*Automaton (or POIO Automaton, POIOA) is a tuple M= (S, s in , I, O,T), ...##
###
Decomposability in Input Output Conformance Testing

2013
*
Electronic Proceedings in Theoretical Computer Science
*

Particularly, we are interested in using component specifications for conformance

doi:10.4204/eptcs.111.5
fatcat:kcam22dqxbfj3lysl5rtjiebny
*testing*of black-box components, using the theory of*input*-*output*conformance (ioco)*testing*. ... We develop our approach within the context of*input*-*output*conformance*testing*(ioco) [13] , a model-based*testing*theory using formal models based on*input*-*output*labeled transition systems (IOLTSs). ... In*order*to formally reason about the observations of*inputs*,*outputs*and quiescence, we introduce the set of suspension traces. ...##
###
Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing
[chapter]

2017
*
Lecture Notes in Computer Science
*

We propose an

doi:10.1007/978-3-319-57666-4_5
fatcat:4cygccsc6rfmblgsxwtpjgpoke
*input*/*output*conformance*testing*theory utilizing Modal Interface*Automata*with Input Refusals (IR-MIA) as novel behavioral formalism for both the specification and the implementation under ...*test*. ... Modal*Input*/*Output*Conformance with Input Refusals IOLTS permit specifications s to be underspecified by means of unspecified input behaviors and nondeterministic*input*/*output*behaviors. ...##
###
Testing Real-Time Multi Input-Output Systems
[chapter]

2005
*
Lecture Notes in Computer Science
*

A

doi:10.1007/11576280_19
fatcat:4pc2xtfeovhh5o2c6znzdleaou
*test*derivation procedure which is nondeterministic and parameterized is further developed, and shown to be sound and complete wrt mtiocoM. ... In formal*testing*, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quiescence is sometimes applied. ... Formally, channels are represented as a partitioning of the sets of input and output actions, each partition class defining the*inputs*(*outputs*) belonging to an individual*input*(*output*) channel. ...##
###
On the Complexity of Input Output Conformance Testing
[chapter]

2014
*
Lecture Notes in Computer Science
*

*Input*-

*output*conformance (ioco)

*testing*is a well-known approach to model-based

*testing*. In this paper, we study the complexity of checking ioco. ... In

*order*to formally reason about the observations of

*inputs*,

*outputs*and quiescence, we introduce the set of suspension traces. ... To this end, we first generalize the transition over a sequence of

*input*,

*output*and quiescence actions. Let L δ denote the set L ∪ {δ}.

*Input*-

*Output*Conformance

*Testing*with Quiescence. ...

##
###
Factorized test generation for multi-input/output transition systems
[chapter]

1998
*
Testing of Communicating Systems
*

By isolating the relevant part of the specification that is needed to generate

doi:10.1007/978-0-387-35381-4_5
fatcat:r7jzrkb4ffcx7i3fpxrkkk3yb4
*tests*for each of these simpler correctness criteria and using this part to generate*tests*from,*test*generation can be done ... In this paper we present factorized*test*generation techniques that can be used to generate*test*cases from a specification that is modelled as a labelled transition system. ... .,*input*/*output**automata*(IOA, [9] ),*input*/*output*state machines (IOSM, [11] ),*input*/*output*labelled transition systems (IOLTS, [4] ) and*input*/*output*transition systems (lOTS, [14] ). ...##
###
Input–output conformance testing for software product lines

2016
*
Journal of Logical and Algebraic Methods in Programming
*

We extend the theory of

doi:10.1016/j.jlamp.2016.09.007
fatcat:fqs5lyqk3vgljibqfvukg436hq
*input*-*output*conformance (IOCO)*testing*to accommodate behavioral models of software product lines (SPLs). We present the notions of residual and spinal*testing*. ... We show that residual*testing*is complete but does not usually lead to much reduction in the*test*-suite. In contrast, spinal*testing*is not necessarily complete but does reduce the*test*-suite. ... plain*input*-*output*transition system models) as*test*models for model-based*testing*. ...##
###
Input-Output Conformance Simulation (iocos) for Model Based Testing
[chapter]

2013
*
Lecture Notes in Computer Science
*

A new model based

doi:10.1007/978-3-642-38592-6_9
fatcat:axzgwshdyfh7zn5pyswdkpvfkq
*testing*theory built on simulation semantics is presented. At the core of this theory there is an*input*-*output*conformance simulation relation (iocos). ... An alternative characterisation of iocos is provided in terms of*testing*semantics. Finally we present an algorithm that produces a*test*suite for any specification. ... In*order*to deal with*input*-*output*behaviours we are going to consider two disjoint finite sets of actions: inputs I and outputs O. ...##
###
Overcoming controllability problems in distributed testing from an input output transition system

2011
*
Distributed computing
*

This paper investigates the use of coordination messages to overcome controllability problems when

doi:10.1007/s00446-011-0153-5
fatcat:76ara24nyjhqrbididszpf3tum
*testing*from an*input**output*transition system and gives an algorithm for introducing sufficient messages ... This has led to interest in schemes where the testers at the individual ports send coordination messages to one another through an external communications network in*order*to overcome controllability problems ... In*order*to simplify the definition we let*input*,*output*or quiescence a i in σ be represented by event a i . ...##
###
SYNCHRONIZING AND HOMING EXPERIMENTS FOR INPUT/OUTPUT AUTOMATA

2017
*
System Informatics
*

The paper is devoted to studying the ('gedanken') experiments with

doi:10.31144/si.2307-6410.2017.n10.p1-10
fatcat:3xivfxaxwzhaxea3h2me4fitzm
*input*/*output**automata*. ... The procedures for deriving the corresponding ('gedanken') experiments for*input*/*output**automata*are based on the well-studied solutions to these problems for Finite State Machines. ... above can be derived against*input*/*output**automata*. ...##
###
Learning Moore Machines from Input-Output Traces
[article]

2016
*
arXiv
*
pre-print

We develop three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of

arXiv:1605.07805v2
fatcat:xvpb6do73rdpzmntaw3p67n4ki
*input*-*output*traces into an incomplete Moore machine and then completes the machine with self-loops ... The problem of learning*automata*from example traces (but no equivalence or membership queries) is fundamental in*automata*learning theory and practice. ... We want to learn a Moore machine from a given set of*input*-*output*traces. ...##
###
Verifying timed behavior automata with input/output critical races
[chapter]

1993
*
Lecture Notes in Computer Science
*

We show how to mirror timed behavior

doi:10.1007/3-540-56922-7_35
fatcat:ooflwjzrejbb7g7siqqhctdhdu
*automata*with*input*/*output*races, and show that constraint-graph satisfaction can still be computed efficiently by linear-time shortest-path algorithms. ... Branching controlled by*input*/*output*races models more interesting timing properties such as timeout and exception handling. ... Both are mixed-type (*input*/*output*) critical races. ...##
###
Improving test quality using robust unique input/output circuit sequences (UIOCs)

2006
*
Information and Software Technology
*

In finite state machine (FSM) based

doi:10.1016/j.infsof.2005.08.001
fatcat:3uqboxgvgfg7pkwguet3b4ecxu
*testing*, the problem of fault masking in the unique*input*/*output*(UIO) sequence may degrade the*test*performance of the UIO based methods. ... This paper investigated this problem and proposed the use of a new type of unique*input*/*output*circuit (UIOC) sequence for state verification, which may help to overcome the drawbacks that exist in the ... Otherwise, the machine is*partially*specified. An FSM is strongly connected if, given any*ordered*pair of states (s i , s j ), there is a sequence of transition that moves the FSM from s i to s j . ...##
###
Monadic Sequence Testing and Explicit Test-Refinements
[chapter]

2016
*
Lecture Notes in Computer Science
*

On this basis, we rephrase the concept of

doi:10.1007/978-3-319-41135-4_2
fatcat:u6jbkzoyp5bxdajnzkqilmsuqq
*test*-refinements for inclusion, deadlock and IOCO-like*tests*, together with a formal theory of its relation to traditional, IO-*automata*based notions. ... We present an abstract framework for sequence*testing*that is implemented in Isabelle/HOL-TestGen. ... The*Input*/*Output**Automata**Input*-*output*labelled transition systems are going back to the notions of Lynch and Tuttle [19] . ...
« Previous

*Showing results 1 — 15 out of 4,344 results*