Reaching and Distinguishing States of Distributed Systems

DOI10.1137/090771296zbMath1209.68299MaRDI QIDQ5390603

Robert M. Hierons

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed systems; testing; finite state machine; multiport systems

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

The complexity of asynchronous model based testing