Summary: An Implementation of Three Algorithms for
Timing Verification Based on Automata Emptiness
R. Alur \Lambda C. Courcoubetis y D. Dill z N. Halbwachs x H. Wong­Toi z
1 Introduction
Designing correct algorithms for systems involving
interaction among state machines, such as communi­
cation protocols and concurrent algorithms, is known
to be a difficult task. Design errors are often over­
looked because of the difficulty in reasoning about
all possible executions of a concurrent system. Tra­
ditional debugging techniques, such as simulation and
prototype testing, may fail because the potential state­
space of the system is too large for all bugs to be
revealed. Consequently, there has been increasing in­
terest in the use of formal methods for the verification
of concurrent systems.
Most work in this field has concentrated on the se­
quencing and coordination of system events, abstract­
ing away the times at which events occur. However
many systems are time­critical: their behaviors may

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences