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

Bibliographic Details
Main Author: Matos, Andre de
Publication Date: 2020
Other Authors: Leucker, Martin, Pereira, David, Pinto, Jorge Sousa
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10400.22/18539
Summary: 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 using 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 RMTL- ∫ formulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.
id RCAP_f2a662bcd3757fac69a2cf7e8cb90552
oai_identifier_str oai:recipp.ipp.pt:10400.22/18539
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Real-time MTL with durations as SMT with applications to schedulability analysisMetric temporal logicSchedulability analysisConstraint programmingSatisfiability modulo theoriesThis 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 using 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 RMTL- ∫ formulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.IEEEREPOSITÓRIO P.PORTOMatos, Andre deLeucker, MartinPereira, DavidPinto, Jorge Sousa20202031-12-01T00:00:00Z2020-01-01T00:00:00Zconference objectinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10400.22/18539eng10.1109/TASE49443.2020.00016info:eu-repo/semantics/embargoedAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-04-02T03:16:25Zoai:recipp.ipp.pt:10400.22/18539Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T00:49:34.273308Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Real-time MTL with durations as SMT with applications to schedulability analysis
title Real-time MTL with durations as SMT with applications to schedulability analysis
spellingShingle Real-time MTL with durations as SMT with applications to schedulability analysis
Matos, Andre de
Metric temporal logic
Schedulability analysis
Constraint programming
Satisfiability modulo theories
title_short Real-time MTL with durations as SMT with applications to schedulability analysis
title_full Real-time MTL with durations as SMT with applications to schedulability analysis
title_fullStr Real-time MTL with durations as SMT with applications to schedulability analysis
title_full_unstemmed Real-time MTL with durations as SMT with applications to schedulability analysis
title_sort Real-time MTL with durations as SMT with applications to schedulability analysis
author Matos, Andre de
author_facet Matos, Andre de
Leucker, Martin
Pereira, David
Pinto, Jorge Sousa
author_role author
author2 Leucker, Martin
Pereira, David
Pinto, Jorge Sousa
author2_role author
author
author
dc.contributor.none.fl_str_mv REPOSITÓRIO P.PORTO
dc.contributor.author.fl_str_mv Matos, Andre de
Leucker, Martin
Pereira, David
Pinto, Jorge Sousa
dc.subject.por.fl_str_mv Metric temporal logic
Schedulability analysis
Constraint programming
Satisfiability modulo theories
topic Metric temporal logic
Schedulability analysis
Constraint programming
Satisfiability modulo theories
description 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 using 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 RMTL- ∫ formulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.
publishDate 2020
dc.date.none.fl_str_mv 2020
2020-01-01T00:00:00Z
2031-12-01T00:00:00Z
dc.type.driver.fl_str_mv conference object
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.22/18539
url http://hdl.handle.net/10400.22/18539
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1109/TASE49443.2020.00016
dc.rights.driver.fl_str_mv info:eu-repo/semantics/embargoedAccess
eu_rights_str_mv embargoedAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833600712640036864

Similar Items