Deciding the satisfiability of MITL specifications

MaRDI QIDQ4992507zbMATH OpenFDO

Authors Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro

Publication date 9 June 2021

Full work available at URL https://arxiv.org/abs/1307.4469, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2013.8

Mathematics Subject Classification ID

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

Recommendations

• An SMT-based approach to satisfiability checking of MITL
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Revisiting MITL to fix decision procedures
• On MITL and alternating timed automata over infinite words
• Deciding continuous-time metric temporal logic with counting modalities

Cited in

(5)

• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Satisfiability on mixed instances
• Revisiting MITL to fix decision procedures
• Constraint LTL satisfiability checking without automata
• An SMT-based approach to satisfiability checking of MITL

This page was built for publication: Deciding the satisfiability of MITL specifications

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