Canonical finite state machines for distributed systems

DOI10.1016/j.tcs.2009.09.039zbMath1186.68042OpenAlexW2140903976MaRDI QIDQ1044846

Robert M. Hierons

Publication date: 15 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.039

zbMATH Keywords

equivalencefinite state machinecanonicaldistributed test architecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Distributed systems (68M14)

Related Items (1)

Implementation relations and test generation for systems with distributed interfaces

Uses Software

• AsmL

Cites Work

• Unnamed Item
• Unnamed Item
• On state reduction of incompletely specified finite state machines
• The synchronization problem in protocol testing and its complexity
• Coordination algorithm for distributed testing
• On the testability of SDL specifications
• Checking sequences for distributed test architectures
• State Reduction in Incompletely Specified Finite-State Machines
• Formal Techniques for Networked and Distributed Systems – FORTE 2004

This page was built for publication: Canonical finite state machines for distributed systems