Testing Systems Specified as Partial Order Input/Output Automata

  title={Testing Systems Specified as Partial Order Input/Output Automata},
  author={Gregor von Bochmann and Stefan Haar and Claude Jard and Guy-Vincent Jourdan},
An Input/Output Automaton is an automaton with a finite number of states where each transition is associated with a single inpu f 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… 

Model Based Testing for Concurrent Systems with Labeled Event Structures

A theoretical testing framework and a test generation algorithm for concurrent systems specified with true concurrency models, such as Petri nets or networks of automata, allowing to deal with strong and weak concurrency.

A More Precise Implementation Relation for Distributed Testing

It is shown that diocoo is strictly weaker than dioco but is equivalent to dioco if processes cannot be output-divergent, and it is proved that the Oracle problem is NP-complete but can be solved in polynomial time if there is an upper bound on the number of local testers.

Model‐based testing for concurrent systems with labelled event structures

A theoretical testing framework and a test generation algorithm for concurrent systems specified with true‐concurrency models, such as Petri nets or networks of automata, allowing to deal with strong and weak concurrency.

Runtime Verification Based on Executable Models: On-the-Fly Matching of Timed Traces

The paper studies on-the-fly conformance relations for timed systems (i.e., systems whose inputs and outputs are distributed along the time axis) and suggests a practice-oriented methodology for creating and configuring monitors for timed system based on executable models.

Verifying and Comparing Finite State Machines for Systems that Have Distributed Interfaces

  • R. Hierons
  • Computer Science
    IEEE Transactions on Computers
  • 2013
It is proved that a form of model-checking is undecidable when the authors have distributed observations and given conditions under which N ⊆<sub>s</sub><sup>k</sup> M is decidable.

Scenarios-Based Testing of Systems with Distributed Ports

This paper focuses on the problem of formally testing systems with distributed components that, in general, have independent behaviors but that at certain points of time synchronization can occur.

Testing concurrent systems through event structures

This thesis proposes a generalization of the ioco conformance relation, based on Petri nets specifications and their partial order semantics given by their unfoldings, preserving thus independence of actions from the specification.

Conformance Testing with Respect to Partial-Order Specifications

It is shown that the partial-order testing approach introduced for a single partial order specification can be adapted to testing PO-Charts which define various combinations of different partial orders which are sequenced by strict or week sequencing, including loops.

Implementation relations and test generation for systems with distributed interfaces

Practical notions of conformance for an input output transition system that has multiple ports are explored, adapting the widely used ioco implementation relation to this situation.

The complexity of asynchronous model based testing



Testing Input/Output Partial Order Automata

An extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA), and develops the formal framework for distributed testing in this architecture and compares with the synchronous I/O automaton setting.

Submodule Construction for Specifications with Input Assumptions and Output Guarantees

This paper presents a generalization of this problem and its solution in the context of relational databases and shows that this general solution can be used to derive several of the known algorithms that solve the problem in thecontext of regular behavior specifications based on finite state automata with synchronous communication or interleaving semantics.

An introduction to input/output automata

This paper is intended to introduce researchers to the input output automaton model and examines several illustrative examples concerning candy vending machines and other uses of the model.

Principles and methods of testing finite state machines-a survey

The fundamental problems in testing finite state machines and techniques for solving these problems are reviewed, tracing progress in the area from its inception to the present and the stare of the art is traced.

Realizability and verification of MSC graphs

Realizability Criteria for Compositional MSC

This work develops a formal framework to study realizability of compositional MSC [GMP03], and uses it to derive a complete classification of criteria that is closely related to the criteria for MSC from [MGR05].

Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports

The issue of test selection with respect to a general distributed test architecture containing distributed interfaces, and the fact that the methods given in the literature cannot ensure the same fault coverage as the corresponding original testing methods is investigated.

Synthesis of Communicating Finite-State Machines with Guaranteed Progress

A methodology to synthesize two communicating finite-state machines which exchange messages over two one-directional, FIFO channels that requires an O(st) time.

Realizability of Collaboration-based Service Specifications

It is shown that given some conditions, some problems can already be detected at an abstract collaboration level, without needing to look into detailed interactions, in terms of realizability.

Modelling Recursive Calls with UML State Diagrams

It is shown that this can lead to anomalous behaviour, and in particular that it is not possible to model recursive calls, in which an object receives a second message whilst still in the process of reacting to the first.