Petri nets: an introduction
Software testing based on formal specifications: a theory and a tool
Software Engineering Journal
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
An Approach to Program Testing
ACM Computing Surveys (CSUR)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
How Much Testing is Enough? Applying Stopping Rules to Behavioral Model Testing
HASE '99 The 4th IEEE International Symposium on High-Assurance Systems Engineering
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
A Generic Method for Statistical Testing
ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
Software Testing, Verification & Reliability
Yasper: a tool for workflow modeling and analysis
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Methodology for the Generation of Program Test Data
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Synchronizing sequences on not strongly connected Petri nets (Work-in-Progress)
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Hi-index | 0.00 |
We consider software systems consisting of a set of components running as a sequential process. We model such software systems as a special class of transition systems. The difference with existing approaches is that we propose a test procedure based on the structure of the model and the prior test history that can be used for exhaustive testing in an efficient way. On top of that we provide a statistical stopping rule, that is independent of the underlying way of walking through the system, which allows us to stop earlier with a certain statistical reliability.