{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:04Z","timestamp":1725552124262},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309468"},{"type":"electronic","value":"9783540316169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603009_11","type":"book-chapter","created":{"date-parts":[[2005,11,28]],"date-time":"2005-11-28T11:13:33Z","timestamp":1133176413000},"page":"127-141","source":"Crossref","is-referenced-by-count":0,"title":["A New Verification Procedure for Partially Clairvoyant Scheduling"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Desovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming\u00a073, 129\u2013174 (1996)","journal-title":"Mathematical Programming"},{"doi-asserted-by":"crossref","unstructured":"Gerber, R., Pugh, W., Saksena, M.: Parametric Dispatching of Hard Real-Time Tasks. IEEE Transactions on Computers (1995)","key":"11_CR2","DOI":"10.1109\/12.372041"},{"unstructured":"Larsen, K.G., Steffen, B., Weise, C.: Continuous modelling of real time and hybrid systems. Technical report, Aalborg Universitet, BRICS Technical Report (2003)","key":"11_CR3"},{"unstructured":"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)","key":"11_CR4"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1024930227883","volume":"2","author":"K. Subramani","year":"2003","unstructured":"Subramani, K.: An analysis of partially clairvoyant scheduling. Journal of Mathematical Modelling and Algorithms\u00a02(2), 97\u2013119 (2003)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"11_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jsco.1997.0122","volume":"24","author":"V. Weispfenning","year":"1997","unstructured":"Weispfenning, V.: Simulation and optimization by quantifier elimination. Journal of Symbolic Computation\u00a024(2), 189\u2013208 (1997); Applications of quantifier elimination (Albuquerque, NM) (1995)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603009_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:20Z","timestamp":1619507000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603009_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309468","9783540316169"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11603009_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}