A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Real-time MTL with durations as SMT with applications to schedulability analysis
2020
2020 International Symposium on Theoretical Aspects of Software Engineering (TASE)
This paper introduces a synthesis procedure for the satisfiability problem of RMTL-formulas as SAT solving modulo theories. RMTL-is a real-time version of metric temporal logic (MTL) extended by a duration quantifier allowing to measure time durations. For any given formula, a SAT instance modulo the theory of arrays, uninterpreted functions with equality and non-linear real-arithmetic is synthesized and may then be further investigated using appropriate SMT solvers. We show the benefits of
doi:10.1109/tase49443.2020.00016
fatcat:ttje24ym3bemjk5tvllknymloe