Change search
ReferencesLink to record
Permanent link

Direct link
Programming with time-constrained reactions
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
Carmen Systems.
Oregon Health & Science University.
Chalmers University of Technology.
2005 (English)Report (Other academic)
Abstract [en]

In this paper we argue that a programming language for real-time systems should support the declaration of time-constraints, and that those constraints should attach to a welldeveloped notion of reactions. To make our claims more precise, we introduce Timber, which is a concurrent programming language based on a model of non-blocking, reactive objects. Timber supports both upper and lower time constraints on a reaction, where upper constraints correspond to classical deadlines, and lower constraints constitute the systematic capturing of well-defined points in the future as events in their own right. A series of programming examples illustrates how these mechanisms can be used to express simple solutions to common problems in practical real-time programming, and the relation between Timber and deadline-based scheduling theory is explored.

Place, publisher, year, edition, pages
2005. , 20 p.
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-23553Local ID: 77398cd0-d3a0-11db-b6e3-000ea68e967bOAI: diva2:996602
Godkänd; 2005; Bibliografisk uppgift: Submitted to the EuroMicro Conference on Real-Time Systems (ECRTS '05); 20070316 (ysko)Available from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Open Access in DiVA

fulltext(238 kB)1 downloads
File information
File name FULLTEXT01.pdfFile size 238 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Nordlander, Johan
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link