Trace and testing equivalence on asynchronous processes
Information and Computation
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
A theory of regular MSC languages
Information and Computation
Testing transition systems with input and output testers
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Grammar based asynchronous testing
Proceedings of the 2nd India software engineering conference
Automated Software Testing of Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
The complexity of asynchronous model based testing
Theoretical Computer Science
Hi-index | 0.00 |
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing systems based on a natural notion of observability in terms of input-output relations. We propose two notions of test equivalence: one which corresponds to presenting all test inputs up front and the other which corresponds to interactively feeding inputs to the system under test. We compare our notions with those studied earlier, notably the equivalence proposed by Tretmans. In Tretmans' framework, asynchrony is modelled using synchronous communication by augmenting the state space of the system with queues. We show that the first equivalence we consider is strictly weaker than Tretmans' equivalence and undecidable, whereas the second notion is incomparable. We also establish (un)decidability results for these equivalences.