Reaching and Distinguishing States of Distributed Systems

DOI10.1137/090771296MaRDI QIDQ5390603zbMATH OpenOpenAlexFDO

Authors 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

testingdistributed systemsfinite state machinemultiport systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Identifiability of distributed systems
• scientific article; zbMATH DE number 3989187
• The complexity of reachability in distributed communicating processes
• scientific article; zbMATH DE number 3896752
• Reachability analysis on distributed executions
• Quantified abstract configurations of distributed systems
• scientific article; zbMATH DE number 227440
• scientific article; zbMATH DE number 1759747

Cited in

(4)

• scientific article; zbMATH DE number 1277093 (Why is no real title available?)
• The complexity of asynchronous model based testing
• scientific article; zbMATH DE number 1418451 (Why is no real title available?)
• Canonical finite state machines for distributed systems

This page was built for publication: Reaching and Distinguishing States of Distributed Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390603)