research-article

Logical reliability of interacting real-time tasks

Authors:

Krishnendu Chatterjee,

Arkadeb Ghosal,

Thomas A. Henzinger,

Christoph M. Kirsch,

Claudio Pinello,

Alberto Sangiovanni-VincentelliAuthors Info & Claims

DATE '08: Proceedings of the conference on Design, automation and test in Europe

Pages 909 - 914

https://doi.org/10.1145/1403375.1403595

Published: 10 March 2008 Publication History

Abstract

We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that checks if the given short-term (e.g., single-period) reliability of a program variable update in an implementation is sufficient to meet the logical reliability requirement (of the program variable) in the long run. We then present a notion of design by refinement where a task can be refined by another task that writes to program variables with less logical reliability. The resulting analysis can be combined with an incremental schedulability analysis for interacting real-time tasks proposed earlier for the Hierarchical Timing Language (HTL), a coordination language for distributed real-time systems. We implemented a logical-reliability-enhanced prototype of the compiler and runtime infrastructure for HTL.

References

[1]

I. Assayad, A. Girault, and H. Kalla. A bi-criteria scheduling heuristics for distributed embedded systems under reliability and real-time constraints. In DSN. IEEE, 2004.

Digital Library

[2]

M. Baleani, A. Ferrari, L. Mangeruca, M. Peri, S. Pezzini, and A. Sangiovanni-Vincentelli. Fault-tolerant platforms for automotive safety-critical applications. In CASES. ACM, 2003.

Digital Library

[3]

F. Cristian. Understanding fault-tolerant distributed systems. Communications of the ACM, 34(2), 1991.

Digital Library

[4]

W. P. Dotson and J. O. Gobien. A new analysis technique for probabilistic graphs. IEEE Trans. Circuits and systems, 10, 1979.

[5]

R. Durrett. Probability: Theory and Examples. Duxbury Press, 1995.

[6]

A. Ghosal, T. A. Henzinger, D. Iercan, C. Kirsch, and A. Sangiovanni-Vincentelli. A hierarchical coordination language for interacting real-time tasks. In EMSOFT. ACM, 2006.

Digital Library

[7]

T. A. Henzinger, B. Horowitz, and C. M. Kirsch. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE, 91, 2003.

Digital Library

[8]

D. Iercan. Tsl compiler. Technical report, 'Politehnica' University of Timisoara, 2005.

[9]

V. Izosimov, P. Pop, P. Eles, and Z. Peng. Design optimization of time-and cost-constrained fault-tolerant distributed embedded systems. In DATE. ACM, 2005.

Digital Library

[10]

V. Izosimov, P. Pop, P. Eles, and Z. Peng. Synthesis of fault-tolerant embedded systems with checkpointing and replication. In Intl. Work. on Electronic Design, Test and Applications. IEEE, 2006.

Digital Library

[11]

V. Izosimov, P. Pop, P. Eles, and Z. Peng. Synthesis of fault-tolerant schedules with transparency/performance trade-offs for distributed embedded systems. In DATE, 2006.

Digital Library

[12]

D. Kececioglu. Reliability Engineering Handbook, volume 2. Prentice Hall, 1991.

Digital Library

[13]

C. Pinello, L. Carloni, and A. Sangiovanni-Vincentelli. Fault-tolerant deployment of embedded software for cost-sensitive real-time feedback-control applications. In DATE. ACM, 2004.

Digital Library

[14]

S. Rai and A. Kumar. Recursive technique for computing system reliability. IEEE Trans. on Reliability, 36, 1987.

[15]

A. Sangiovanni-Vincentelli and et al. Benefits and challenges for platform-based design. In Proc. DAC, volume 91. ACM, 2004.

Digital Library

Cited By

Asadi AChatterjee KSvoboda JSaona Urmeneta RSobocinski PLago UEsparza J(2024)Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary WeightsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662080(1-12)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662080
Chatterjee KIbsen-Jensen RIndyk P(2015)The value 1 problem under finite-memory strategies for concurrent mean-payoff gamesProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722198(1018-1029)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722198
Velner Y(2012)The complexity of mean-payoff automaton expressionProceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-31585-5_36(390-402)Online publication date: 9-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31585-5_36
Show More Cited By

Index Terms

Logical reliability of interacting real-time tasks

Recommendations

A hierarchical coordination language for reliable real-time tasks
A hierarchical coordination language for interacting real-time tasks
EMSOFT '06: Proceedings of the 6th ACM & IEEE International conference on Embedded software

We designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems. Critical timing constraints are specified within the language,and ensured by the compiler. Programs in HTL are extensible in two ...
Co-Scheduling Variable Execution Time Requirement Real-Time Tasks and Non Real-Time Tasks
ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems

By scheduling the non real-time tasks earlier while still meeting deadlines for the real-time tasks, the overall system performance can be improved. In particular, we believe that the variability in the execution time requirements of real-time tasks can ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DATE '08: Proceedings of the conference on Design, automation and test in Europe

March 2008

1575 pages

ISBN:9783981080131

DOI:10.1145/1403375

General Chair:
Donatella Sciuto
Politecnico di Milano, Italy

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

The EDA Consortium
EDAA: European Design Automation Association
ECSI
SIGDA: ACM Special Interest Group on Design Automation
The IEEE Computer Society TTTC
IEEE Council on Electronic Design Automation (CEDA)
The Russian Academy of Sciences: The Russian Academy of Sciences

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 March 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

DATE '08

Sponsor:

EDAA
SIGDA
The Russian Academy of Sciences

DATE '08: Design, Automation and Test in Europe

March 10 - 14, 2008

Munich, Germany

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
103
Total Downloads

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

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Asadi AChatterjee KSvoboda JSaona Urmeneta RSobocinski PLago UEsparza J(2024)Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary WeightsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662080(1-12)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662080
Chatterjee KIbsen-Jensen RIndyk P(2015)The value 1 problem under finite-memory strategies for concurrent mean-payoff gamesProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722198(1018-1029)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722198
Velner Y(2012)The complexity of mean-payoff automaton expressionProceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-31585-5_36(390-402)Online publication date: 9-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31585-5_36
Das DChakrabarti PSinha PBahulkar AKesavasamy KPrabhakar TShroff G(2011)Robust embedded software design through early analysis of quality faultsProceedings of the 4th India Software Engineering Conference10.1145/1953355.1953360(31-40)Online publication date: 24-Feb-2011
https://dl.acm.org/doi/10.1145/1953355.1953360
Chatterjee KDoyen LEdelsbrunner HHenzinger TRannou P(2010)Mean-payoff automaton expressionsProceedings of the 21st international conference on Concurrency theory10.5555/1887654.1887673(269-283)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1887654.1887673
Chatterjee KDoyen LHenzinger T(2010)Expressiveness and Closure Properties for Quantitative LanguagesLogical Methods in Computer Science10.2168/LMCS-6(3:10)20106:3Online publication date: 30-Aug-2010
https://doi.org/10.2168/LMCS-6(3:10)2010
Chatterjee KDoyen LHenzinger T(2010)Quantitative languagesACM Transactions on Computational Logic10.1145/1805950.180595311:4(1-38)Online publication date: 20-Jul-2010
https://dl.acm.org/doi/10.1145/1805950.1805953
Chatterjee KDoyen LEdelsbrunner HHenzinger TRannou P(2010)Mean-Payoff Automaton ExpressionsCONCUR 2010 - Concurrency Theory10.1007/978-3-642-15375-4_19(269-283)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15375-4_19
Henzinger TKirsch CMarques ESokolova A(2009)Distributed, Modular HTLProceedings of the 2009 30th IEEE Real-Time Systems Symposium10.1109/RTSS.2009.9(171-180)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1109/RTSS.2009.9
Chatterjee KDoyen LHenzinger T(2009)Expressiveness and Closure Properties for Quantitative LanguagesProceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science10.1109/LICS.2009.16(199-208)Online publication date: 11-Aug-2009
https://dl.acm.org/doi/10.1109/LICS.2009.16
Show More Cited By

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten