STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Testing finite state machines: fault detection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
PPP design, implementation, and debugging
PPP design, implementation, and debugging
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Communication and Concurrency
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
IEEE Transactions on Software Engineering
A Formal Approach for Passive Testing of Protocol Data Portions
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Passive testing and applications to network management
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Network protocol system monitoring: a formal approach with passive testing
IEEE/ACM Transactions on Networking (TON)
Self-tuned passive testers for grey-box distributed systems with indefinite communication delays
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
On the synthesis of adaptive tests for nondeterministic finite state machines
Programming and Computing Software
QE modeling and test selection based on PNFSM
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Testing nondeterministic finite state machines with respect to the separability relation
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
Hi-index | 0.00 |
Given a nondeterministic protocol specification, we want to determine the deterministic implementation under test with a conformance of trace inclusion in the specification. We identify them using both active and passive testing. Four cases are studied with experiments on Internet protocols. In the first two cases, the implementation machine is a derived machine of the specification. In the third case, the implementation machine is a derived machine of the k-way expansion of the specification machine. The fourth case deals with the general case of nondeterministic machines.