Programming with time-constrained reactions
2005 (English)Report (Other academic)
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
IdentifiersURN: urn:nbn:se:ltu:diva-23553Local ID: 77398cd0-d3a0-11db-b6e3-000ea68e967bOAI: oai:DiVA.org:ltu-23553DiVA: diva2:996602
Godkänd; 2005; Bibliografisk uppgift: Submitted to the EuroMicro Conference on Real-Time Systems (ECRTS '05); 20070316 (ysko)2016-09-292016-09-29Bibliographically approved