Abstract. 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. In [1], we introduced a new formalism, in which each transition is associated with a bipartite partially ordered set made of concurrent inputs followed by concurrent outputs. In this paper, we generalize this model to Partial Order Input/Output Automata (POIOA), in which each transition is associated with an almost arbitrary partially ordered set of inputs and outputs. This formalism can be seen as High-Level Messages Sequence Charts with inputs and outputs and allows for the specification of concurrency between inputs and outputs in a very general, direct and concise way. We give a formal definition of this framework, and define several conformance relations for comparing system specifications expressed in this formalism. Then we show how to derive a test suite that guarantees to detect faults defined by a POIOAspecific fault model: missing output faults, unspecified output faults, weaker precondition faults, stronger precondition faults and transfer faults.
In REF , a partial order input/output automaton (POIOA), where each transition is associated with an almost arbitrary ordered set of inputs and outputs, is used to represent the expected behavior.
Testing Systems Specified as Partial Order Input/Output Automata
in "Testcom/Fates 08, 20th IFIP International Conference on Testing of Communicating Systems and 8th International Workshop on Formal Approaches to Testing of Software
Mathematics Computer Science