Real-time MTL with durations as SMT with applications to schedulability analysis

Andre de Matos, Martin Leucker, David Pereira, Jorge Sousa Pinto
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
more » ... g RMTL-with the given SMT encoding on a diversified set of examples that include in particular its application in the area of schedulability analysis. Therefore, we introduce a simple language for formalizing schedulability problems and show how to formulate timing constraints as RMTLformulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.
doi:10.1109/tase49443.2020.00016 fatcat:ttje24ym3bemjk5tvllknymloe