Title
A Practical and Complete Algorithm for Testing Real-Time Systems
Abstract
. This paper presents a formal method for generating conformancetests for real-time systems. Our algorithm is complete in that,under a test hypothesis, if the system being tested passes every test generatedthen the tested system is bisimilar to its specification. Becausethe test algorithm has exponential worst case complexity and finite stateautomata models of real-time systems are typically very large, a judiciouschoice of model is critical for the successful testing of real-time...
Year
DOI
Venue
1998
10.1007/BFb0055352
FTRTFT
Keywords
Field
DocType
black-box testing,timed automata,testing real-time systems,real-time systems,complete algorithm,real time,real time systems,formal method,black box testing
Transition system,Algorithmics,Computer science,Algorithm,White-box testing,Real-time computing,Finite-state machine,Real-time operating system,Formal specification,Formal methods,Worst-case complexity
Conference
Volume
ISSN
ISBN
1486
0302-9743
3-540-65003-2
Citations 
PageRank 
References 
45
2.03
6
Authors
2
Name
Order
Citations
PageRank
Rachel Cardell-Oliver127133.25
Tim Glover2684.10