Abstract
In this paper, we describe a new algorithm for the problem of checking whether a real-time system has a Partially Clairvoyant schedule (PCS). Existing algorithms for the PCS problem are predicated on sequential quantifier elimination, i.e., the innermost quantifier is eliminated first, followed by the next one and so on. Our technique is radically different in that the quantifiers in the schedulability specification are eliminated in arbitrary fashion. We demonstrate the usefulness of this technique by achieving significant performance improvement over a wide range of inputs. Additionally, the analysis developed for the new procedure may find applications in domains such as finite model theory and classical logic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 129–174 (1996)
Gerber, R., Pugh, W., Saksena, M.: Parametric Dispatching of Hard Real-Time Tasks. IEEE Transactions on Computers (1995)
Larsen, K.G., Steffen, B., Weise, C.: Continuous modelling of real time and hybrid systems. Technical report, Aalborg Universitet, BRICS Technical Report (2003)
Muscettola, N., Smith, B., Chien, S., Fry, C., Rabideau, G., Rajan, K., Yan, D.: In-board planning for autonomous spacecraft. In: The Fourth International Symposium on Artificial Intelligence, Robotics, and Automation for Space (i-SAIRAS) (July 1997)
Subramani, K.: An analysis of partially clairvoyant scheduling. Journal of Mathematical Modelling and Algorithms 2(2), 97–119 (2003)
Weispfenning, V.: Simulation and optimization by quantifier elimination. Journal of Symbolic Computation 24(2), 189–208 (1997); Applications of quantifier elimination (Albuquerque, NM) (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subramani, K., Desovski, D. (2005). A New Verification Procedure for Partially Clairvoyant Scheduling. In: Pettersson, P., Yi, W. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2005. Lecture Notes in Computer Science, vol 3829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603009_11
Download citation
DOI: https://doi.org/10.1007/11603009_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30946-8
Online ISBN: 978-3-540-31616-9
eBook Packages: Computer ScienceComputer Science (R0)