Overcoming controllability problems in distributed testing from an input output transition system

DOI10.1007/S00446-011-0153-5zbMath1257.68109OpenAlexW2102522843MaRDI QIDQ1938361

Robert M. Hierons

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/6257

zbMATH Keywords

input output transition systemdistributed testingcontrollability problemscoordination messages

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Theory of software (68N99)

Related Items (1)

Using schedulers to test probabilistic distributed systems

Uses Software

• AsmL

Cites Work

• Unnamed Item
• The synchronization problem in protocol testing and its complexity
• Checking sequences for distributed test architectures
• Constructing checking sequences for distributed testing
• Controllable Test Cases for the Distributed Test Architecture
• A Greedy Heuristic for the Set-Covering Problem
• Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Overcoming controllability problems in distributed testing from an input output transition system