Towards an algebra for real-time programs

11Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop an algebra for an interval-based model that has been shown to be useful for reasoning about real-time programs. In that model, a system's behaviour over all time is given by a stream (mapping each time to a state) and the behaviour over an interval is determined using an interval predicate, which maps an interval and a stream to a Boolean. Intervals are allowed to be open/closed at either end and adjoining (i.e., immediately adjacent) intervals do not share any common points but are contiguous over their boundary. Values of variables at the ends of open intervals are determined using limits, which allows the possible piecewise continuity of a variable at the boundaries of an interval to be handled in a natural manner. What sort of an algebra does this model give rise to? In this paper, we take a step towards answering that question by investigating an algebra of interval predicates. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Dongol, B., Hayes, I. J., Meinicke, L., & Solin, K. (2012). Towards an algebra for real-time programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7560 LNCS, pp. 50–65). https://doi.org/10.1007/978-3-642-33314-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free