Skip to main content
Conference ProceedingsOPEN ACCESS

Minimum and maximum delay problems in realtime systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 575 LNCS 399-409
DOI: 10.1007/3-540-55179-4_37
34Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider a finite state system with a finite number of clocks, where the transitions may depend on the values of the clocks, and may reset some of the clocks. We address the complexity and provide algorithms for the following problems. Suppose that the system starts from a given current state with a given assignment of values to the clocks. Can a given target state ever appear in the history of the system? What is the earliest time it can appear? What is the latest time it can appear?.

Cite

CITATION STYLE

APA

Courcoubelis, C., & Yannakakis, M. (1992). Minimum and maximum delay problems in realtime systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 399–409). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_37

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