research-article

SMT-based schedulability analysis using RMTL-∫

Authors:

André de Matos Pedro,

David Pereira,

Luís Miguel Pinho,

Jorge Sousa PintoAuthors Info & Claims

ACM SIGBED Review, Volume 14, Issue 3

Pages 40 - 42

https://doi.org/10.1145/3166227.3166234

Published: 22 November 2017 Publication History

Get Access

Abstract

Several methods have been proposed for performing schedulability analysis for both uni-processor and multi-processor real-time systems. Very few of these works use the power of formal logic to write unambiguous specifications and to allow the usage of theorem provers for building the proofs of interest with greater correctness guarantees. In this paper we address this challenge by: 1) defining a formal language that allows to specify periodic resource models; 2) describe a transformational approach to reasoning about timing properties of resource models by transforming the latter specifications into a satisfiability modulo theories problem.

References

[1]

Clark Barrett, Pascal Fontaine, and Cesare Tinelli. The SMT-LIB Standard: Version 2.5. Technical report, Department of Computer Science, The University of Iowa, 2015. Available at www.SMT-LIB.org.

Google Scholar

[2]

L. De Moura and N. Bjørner. Z3: An efficient smt solver. In TACAS'08/ETAPS'08, pages 337--340, 2008.

Digital Library

Google Scholar

[3]

Y. Lakhneche and J. Hooman. Metric temporal logic with durations. Theor. Comput. Sci., 138(1):169--199, 1995.

Digital Library

Google Scholar

[4]

A. M. Pedro, D. Pereira, L.M. Pinho, and J.S. Pinto. Logic-based schedulability analysis for compositional hard real-time embedded systems. SIGBED Review, 12(1):56--64, 2015.

Digital Library

Google Scholar

[5]

A. M. Pedro, D. Pereira, L.M. Pinho, and J.S. Pinto. rmtld3synth Synthesis Tool, 2016. Available at https://github.com/cistergit/rmtld3synth/, version 0.1-alpha.

Google Scholar

[6]

I. Shin and I. Lee. Compositional real-time scheduling framework with periodic model. ACM TECS, 7(3):30:1--30:39, 2008.

Digital Library

Google Scholar

Cited By

View all

de Matos ALeucker MPereira DPinto J(2020)Real-time MTL with durations as SMT with applications to schedulability analysis2020 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE49443.2020.00016(49-56)Online publication date: Dec-2020
https://doi.org/10.1109/TASE49443.2020.00016
Lee HChoi J(2020)Constraint-Based Schedulability Analysis in Multiprocessor Real-Time SystemsIEEE Access10.1109/ACCESS.2020.30228478(165168-165177)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3022847
Yeolekar AMetta RVenkatesh RChakraborty S(2018)Refining Task Specifications using Model Checking2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA.2018.00030(185-191)Online publication date: Aug-2018
https://doi.org/10.1109/RTCSA.2018.00030

Index Terms

SMT-based schedulability analysis using RMTL-∫

Recommendations

Logic-based schedulability analysis for compositional hard real-time embedded systems
Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems

Over the past decades several approaches for schedulability analysis have been proposed for both uni-processor and multi-processor real-time systems. Although different techniques are employed, very little has been put forward in using formal ...
Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

Compositional verification aims at managing the complexity of the verification process by exploiting compositionality of the system architecture. In this paper we explore the use of a temporal epistemic logic to formalize the process of verification of ...
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year. In 1994 schedulability analysis was developed for CAN, showing how worst-case response times ...

Comments

Information & Contributors

Information

Published In

ACM SIGBED Review Volume 14, Issue 3

October 2017

55 pages

EISSN:1551-3688

DOI:10.1145/3166227

Editors:
Saad Mubeen
Mälardalen University, Sweden
,
Geoffrey Nelissen
CISTER/INESC-TEC, ISEP, Portugal

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 November 2017

Published in SIGBED Volume 14, Issue 3

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
32
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

de Matos ALeucker MPereira DPinto J(2020)Real-time MTL with durations as SMT with applications to schedulability analysis2020 International Symposium on Theoretical Aspects of Software Engineering (TASE)10.1109/TASE49443.2020.00016(49-56)Online publication date: Dec-2020
https://doi.org/10.1109/TASE49443.2020.00016
Lee HChoi J(2020)Constraint-Based Schedulability Analysis in Multiprocessor Real-Time SystemsIEEE Access10.1109/ACCESS.2020.30228478(165168-165177)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3022847
Yeolekar AMetta RVenkatesh RChakraborty S(2018)Refining Task Specifications using Model Checking2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA.2018.00030(185-191)Online publication date: Aug-2018
https://doi.org/10.1109/RTCSA.2018.00030

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Logic-based schedulability analysis for compositional hard real-time embedded systems

Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations