Generalizing Logical Execution Time

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

Abstract

In the Logical Execution Time (LET) principle, concurrent software components interact deterministically, reading their inputs atomically at the start of a task and producing outputs atomically after a fixed elapsed logical time. In addition to deterministic concurrency, LET programs yield more deterministic timing when they interact with their physical environment through sensors and actuators. This paper shows through a series of examples that the LET principle can be realized flexibly and generalized using the Lingua Franca coordination language.

Cite

CITATION STYLE

APA

Lee, E. A., & Lohstroh, M. (2022). Generalizing Logical Execution Time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13660 LNCS, pp. 160–181). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-22337-2_8

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