From Mtl to Deterministic Timed Automata

@inproceedings{Nickovic2010FromMT,
  title={From Mtl to Deterministic Timed Automata},
  author={Dejan Nickovic and Nir Piterman},
  booktitle={FORMATS},
  year={2010}
}
In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-var iability assumptions. We handle full MTL and in particular do not impose bounds o the future temporal connectives. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions rega rdin the future. The separation of the continuous from the discrete allows us to f rther determinize our automata. This… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
23 Citations
30 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Similar Papers

Loading similar papers…