Model-checking fair dense-time systems with propositions and events
We propose a temporal logic, \(\hbox {TECTL}^{F}\), for the flexible specification of distributed real-time systems with constraints involving events, propositions, and fairness. We then present algorithms for model-checking \(\hbox {TECTL}^{F}\)formulas and a speed-up technique for refuting certain formulas. Finally, we report the implementation and experiment of the ideas in our tool, \(\mathbf{RED}\) 8.
model-checking fairness events distributed real-time tctl verification