From MITL to Timed Automata [chapter]

Oded Maler, Dejan Nickovic, Amir Pnueli
2006 Lecture Notes in Computer Science  
We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented. Prediction is very difficult, especially about the future. Niels Bohr
doi:10.1007/11867340_20 fatcat:ao23ugrf6vbubg5v3wgmldqdxq