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
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
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Fault-Based Testing in the Absence of an Oracle
COMPSAC '01 Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development
Towards Automatic Distribution of Testers for Distributed Conformance Testing
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Remote testin can be as powerful as local testing
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Asynchronous Observations of Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Theory of "May" Testing for Asynchronous Languages
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Generation of Adaptive Test Cases from Nondeterministic Finite State Models
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
Nondeterministic State Machines in Protocol Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Optimizing the Length of Checking Sequences
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
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
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
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Transition covering tests for systems with queues
Software Testing, Verification & Reliability
Asynchronous Input-Output Conformance Testing
COMPSAC '09 Proceedings of the 2009 33rd Annual IEEE International Computer Software and Applications Conference - Volume 01
Using a model-based test generator to test for standard conformance
IBM Systems Journal
Finite automata and their decision problems
IBM Journal of Research and Development
Applying adaptive test cases to nondeterministic implementations
Information Processing Letters
Testing transition systems with input and output testers
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Generating tests from UML specifications
UML'99 Proceedings of the 2nd international conference on The unified modeling language: beyond the standard
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-based quality assurance of protocol documentation: tools and methodology
Software Testing, Verification & Reliability
Reaching and Distinguishing States of Distributed Systems
SIAM Journal on Computing
A fresh look at testing for asynchronous communication
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
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
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
Hi-index | 5.23 |
In model based testing (MBT), testing is based on a model M that typically is expressed using a state-based language such as an input output transition system (IOTS). Most approaches to MBT assume that communications between the system under test (SUT) and its environment are synchronous. However, many systems interact with their environment through asynchronous channels and the presence of such channels changes the nature of testing. In this paper we investigate the situation in which the SUT interacts with its environment through asynchronous channels and the problems of producing test cases to reach a state, execute a transition, or to distinguish two states. In addition, we investigate the Oracle Problem. All four problems are explored for both FIFO and non-FIFO channels. It is known that the Oracle Problem can be solved in polynomial time for FIFO channels but we also show that the three test case generation problems can also be solved in polynomial time in the case where the IOTS is observable but the general test generation problems are EXPTIME-hard. For non-FIFO channels we prove that all of the test case generation problems are EXPTIME-hard and the Oracle Problem in NP-hard, even if we restrict attention to deterministic IOTSs.