Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FORMATS
2006
Springer

favoriteEmaildiscussreport

92views Formal Methods» more FORMATS 2006»

From MITL to Timed Automata

13 years 8 months ago

From MITL to Timed Automata

Download www-verimag.imag.fr

Abstract. 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

Oded Maler, Dejan Nickovic, Amir Pnueli

Real-time Traffic

Formal Methods | FORMATS 2006 | Niels Bohr | Satisfying Models | Temporal Logic Mitl |

claim paper

Related Content

» The Cost of Punctuality

» Real Time Temporal Logic Past Present Future

» Weak Alternating Timed Automata

» Recursive Timed Automata

» Timed Automata Patterns

» An Efficient Translation of TimedArc Petri Nets to Networks of Timed Automata

» Timing analysis of asynchronous circuits using timed automata

» Axioms for RealTime Logics

» From Mtl to Deterministic Timed Automata

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FORMATS
Authors	Oded Maler, Dejan Nickovic, Amir Pnueli

Comments (0)