From \textsc{mtl} to deterministic timed automata

DOI10.1007/978-3-642-15297-9_13zbMATH Open1290.68077OpenAlexW1558808483MaRDI QIDQ3588091FDOQ3588091

Authors: Dejan Ničković, Nir Piterman 

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15297-9_13

Recommendations

• From MITL to Timed Automata
• On Continuous Timed Automata with Input-Determined Guards
• From real-time logic to timed automata
• \textsc{MightyL}: a compositional translation from MITL to timed automata
• Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking

zbMATH Keywords

metric temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cited In (15)

• On Continuous Timed Automata with Input-Determined Guards
• Metric temporal logic revisited
• Runtime enforcement of timed properties revisited
• Title not available (Why is that?)
• The compound interest in relaxing punctuality
• Monitoring timed properties (revisited)
• On construction of safety signal automata for \(\mathrm{MITL}[\mathcal{U},\mathcal{S}]\) using temporal projections
• On Unary Fragments of MTL and TPTL over Timed Words
• From real-time logic to timed automata
• Counter-Free Input-Determined Timed Automata
• Time-Bounded Verification of CTMCs against Real-Time Specifications
• On MITL and alternating timed automata
• From MITL to Timed Automata
• Bounded variability of metric temporal logic
• Taming large bounds in synthesis from bounded-liveness specifications

This page was built for publication: From \textsc{mtl} to deterministic timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588091)