{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:19:04Z","timestamp":1725484744758},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_8","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T19:45:05Z","timestamp":1180208705000},"page":"87-100","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions"],"prefix":"10.1007","author":[{"given":"Jean-Philippe","family":"Dubernard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Geniet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"8_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-49382-2_22","volume-title":"Proc. of 18thConf. Found. of Software Technology and Theor. Comp. Sci.","author":"L. Aceto","year":"1998","unstructured":"L. Aceto, P. Bouyer, A. Burgue, and K. G. Larsen. The power of reachability testing for timed automata. In Proc. of 18th Conf. Found. of Software Technology and Theor. Comp. Sci., LNCS 1530, pages 245\u2013256. Springer-Verlag, December 1998."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01094342","volume":"8","author":"N.C. Audsley","year":"1995","unstructured":"N.C. Audsley, A. Burns, R.I. David, K.W. Tindell, and A. J. Welling. Fixed priority preemptive scheduling: an historical perspective. The journal of Real-Time Systems, 8:173\u2013198, 1995.","journal-title":"The journal of Real-Time Systems"},{"key":"8_CR3","unstructured":"A. Arnold. Finite transition systems. Prentice Hall, 1994."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF00365393","volume":"3","author":"T. P. Baker","year":"1991","unstructured":"T. P. Baker. Stack-based scheduling of real-time processes. the Journal of Real-Time Systems, 3:67\u201399, 1991.","journal-title":"the Journal of Real-Time Systems"},{"key":"8_CR5","unstructured":"G. C. Buttazzo. Hard Real-Time Computing Systems. Kluwer Academic Publishers, 1997."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"N. Chomsky and M. P. Sch\u00fctzenberger. The algebraic theory of context-free languages. Computer Programming and Formal Systems, pages 118\u2013161, 1963.","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"8_CR7","unstructured":"E. W. Dijkstra. Cooperating sequential processes. Technical Report EWD-123, Technological University Eindhoven, 1965."},{"key":"8_CR8","unstructured":"S. Eilenberg. Automata Languages and machines, volume A. Academic Press, 1976."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"E. Grolleau and A. Choquet-Geniet. Scheduling real-time systems by means of petri nets. In Proc. of 25th Workshop on Real-Time Programming, pages 95\u2013100. Universidad Polit\u00e9cnica de Valencia, 2000.","DOI":"10.1016\/S1474-6670(17)39938-X"},{"key":"8_CR10","unstructured":"D. Geniet. Validation d\u2019applications temps-r\u00e9el \u00e1 contraintes strictes \u00e1 l\u2019aide de langages rationnels. In RTS\u20192000, pages 91\u2013106. Teknea, 2000."},{"key":"8_CR11","unstructured":"E. Grolleau. Ordonnancement Temps-R\u00e9el Hors-Ligne Optimal \u00e1 l\u2019Aide de R\u00e9seaux de Petri en Environnement Monoprocesseur et Multiprocesseur. PhD thesis, Univ. Poitiers, 1999."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. L. Liu","year":"1973","unstructured":"C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46\u201361, 1973.","journal-title":"Journal of the ACM"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"J. Y. T. Leung","year":"1980","unstructured":"J. Y. T. Leung and M.L. Merill. A note on preemptive scheduling of periodic real-time tasks. Information Processing Letters, 11(3):115\u2013118, 1980.","journal-title":"Information Processing Letters"},{"key":"8_CR14","unstructured":"A. K. Mok. Fundamental Design Problems for the Hard Real-Time Environments. PhD thesis, MIT, 1983."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"M. Silly, H. Chetto, and N. Elyounsi. An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. In Proc. of SPDS\u201990, pages 578\u2013585, 1990.","DOI":"10.1109\/SPDP.1990.143607"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"A. Stankovic, M. Spuri, K. Ramamritham, and G. C. Buttazzo. Deadline Scheduling for Real-Time Systems. Kluwer Academic Press, 1998.","DOI":"10.1007\/978-1-4615-5535-3"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:02:19Z","timestamp":1556434939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}