The following information was submitted:
Transactions: INTERNATIONAL JOURNAL of COMPUTERS
Transactions ID Number: 19-329
Full Name: Stefan Bruda
Position: Associate Professor
Age: ON
Sex: Male
Address: Bishop's University, 2600 College St, Sherbrooke, QC J1M1Z7
Country: CANADA
Tel:
Tel prefix:
Fax:
E-mail address: stefan@bruda.ca
Other E-mails:
Title of the Paper: A Testing Theory for Real-Time Systems
Authors as they appear in the Paper: Stefan D. Bruda and Chun Dai
Email addresses of all the authors: stefan@bruda.ca,cdai@cs.ubishops.ca
Number of paper pages: 10
Abstract: We develop a testing theory for real-time systems. We keep the usual notion of success or failure (based on finite runs) but we also provide a mechanism of determining the success or failure of infinite runs, using a formalism similar to the acceptance in Büchi automata. We present two refinement timed preorders similar to De~Nicola and Hennessy's may and must testing. We then provide alternative, behavioural and language-based characterizations for these relations to show that the new preorders are extensions of the traditional preorders. Finally we focus on test generation, showing how tests can be automatically generated out of a timed variant of linear-time logic formulae (namely, TPTL), so that a process must pass the generated test if and only if the process satisfies the given temporal logic formula. Beside the obvious use of such an algorithm (to generate tests), our result also establishes a correspondence between timed must testing and timed temporal!
logic.
Keywords: Formal methods, Real-time systems, Model-based testing, May testing, Must testing, Testing preorders, Test generation, Timed temporal logic, TPTL
EXTENSION of the file: .pdf
Special (Invited) Session: Timed Test Generation Based on Timed Temporal Logic
Organizer of the Session: 632-126
How Did you learn about congress:
IP ADDRESS: 89.120.235.30
