Programming with time-constrained reactions

• 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.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

Dependable Communication and Computation Systems

Kommunikations- och beräkningssystem

Publication and Content Type

vet (subject category)

rap (subject category)