uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards an algebra for real-time programs
Department of Computer Science, The University of Sheffield, UK.
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia.
2012 (English)In: Relational and Algebraic Methods in Computer Science - 13th International Conference, Springer, 2012, p. 50-65Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2012. p. 50-65
Series
Lecture Notes in Computer Science ; 7560
National Category
Philosophy Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-377572DOI: 10.1007/978-3-642-33314-9_4ISBN: 978-3-642-33313-2 (print)OAI: oai:DiVA.org:uu-377572DiVA, id: diva2:1290927
Conference
Relational and Algebraic Methods in Computer Science - 13th International Conference, RAMiCS 2012, Cambridge, UK, September 17-20, 2012
Available from: 2019-02-21 Created: 2019-02-21 Last updated: 2019-09-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Solin, Kim

Search in DiVA

By author/editor
Solin, Kim
PhilosophyComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf