Automatic verification of real time systems: a case study
Résumé
We propose here a tool which implements an algorithm proposed for a decidable class of verification problems and we illustrate the efficiency of the method by giving an automatic treatment of the well-known benchmark called the Generalized Railroad Crossing Problem. The controller is specified (in all its generality) as a 4-line long Gurevich Abstract State Machines (ASM) which is then automatically translated into a FOTL formula which characterizes its set of runs.