A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
From MITL to Timed Automata
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
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