The synchronization problem in protocol testing and its complexity
Information Processing Letters
Test generation with respect to distributed interfaces
Computer Standards & Interfaces
Synchronizable test sequences based on multiple UIO sequences
IEEE/ACM Transactions on Networking (TON)
Synthesis of Finite State Machines: Functional Optimization
Synthesis of Finite State Machines: Functional Optimization
Modeling Reactive Systems with Statecharts: The Statemate Approach
Modeling Reactive Systems with Statecharts: The Statemate Approach
Generating finite state machines from abstract state machines
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Coordination Algorithm for Distributed Testing
The Journal of Supercomputing
A Temporal Approach for Testing Distributed Systems
IEEE Transactions on Software Engineering
Error detection with multiple observers
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
On the testability of SDL specifications
Computer Networks: The International Journal of Computer and Telecommunications Networking
On state reduction of incompletely specified finite state machines
Computers and Electrical Engineering
State Reduction in Incompletely Specified Finite-State Machines
IEEE Transactions on Computers
The Effect of the Distributed Test Architecture on the Power of Testing
The Computer Journal
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Multi-paradigmatic model-based testing
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Research: Synchronizable test sequence generation using UIO sequences
Computer Communications
Testing input/output partial order automata
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
Hi-index | 5.23 |
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multiple ports/interfaces a multi-port FSM is used and in testing, a tester is placed at each port. If the testers cannot communicate with one another directly and there is no global clock then we are testing in the distributed test architecture. It is known that the use of the distributed test architecture can affect the power of testing and recent work has characterised this in terms of local s-equivalence: in the distributed test architecture we can distinguish two FSMs, such as an implementation and a specification, if and only if they are not locally s-equivalent. However, there may be many FSMs that are locally s-equivalent to a given FSM and the nature of these FSMs has not been explored. This paper examines the set of FSMs that are locally s-equivalent to a given FSM M. It shows that there is a unique smallest FSM @g"m"i"n(M) and a unique largest FSM @g"m"a"x(M) that are locally s-equivalent to M. Here smallest and largest refer to the set of traces defined by an FSM and thus to its semantics. We also show that for a given FSM M the set of FSMs that are locally s-equivalent to M defines a bounded lattice. Finally, we define an FSM that, amongst all FSMs locally s-equivalent to M, has fewest states. We thus give three alternative canonical FSMs that are locally s-equivalent to an FSM M: one that defines the smallest set of traces, one that defines the largest set of traces, and one with fewest states. All three provide valuable information and the first two can be produced in time that is polynomial in terms of the number of states of M. We prove that the problem of finding an s-equivalent FSM with fewest states is NP-hard in general but can be solved in polynomial time for the special case where there are two ports.