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 of finite state machines
Computer Networks and ISDN Systems
Coordination Algorithm for Distributed Testing
The Journal of Supercomputing
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
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
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Overcoming observability problems in distributed test architectures
Information Processing Letters
Minimizing coordination channels in distributed testing
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Resolving observability problems in distributed test architectures
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Implementation Relations for the Distributed Test Architecture
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Controllable Test Cases for the Distributed Test Architecture
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Overcoming controllability problems with fewest channels between testers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Canonical finite state machines for distributed systems
Theoretical Computer Science
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
The complexity of asynchronous model based testing
Theoretical Computer Science
Conformance relations for labeled event structures
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
| Hi-index | 0.00 |
We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be executed non-atomically, reacting to asynchronous inputs on several ports, and producing asynchronous output on those ports. We develop the formal framework for distributed testing in this architecture and compare with the synchronous I/O automaton setting. The advantage of the compact modelling by IOPOA combines with low complexity : the number of tests required for concurrent input in our model is polynomial in the number of inputs.