{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:09:57Z","timestamp":1742926197632,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319476766"},{"type":"electronic","value":"9783319476773"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47677-3_10","type":"book-chapter","created":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T06:17:10Z","timestamp":1475648230000},"page":"147-162","source":"Crossref","is-referenced-by-count":5,"title":["Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET"],"prefix":"10.1007","author":[{"given":"Bingbing","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongming","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"key":"10_CR1","volume-title":"Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications","author":"GC Buttazzo","year":"2004","unstructured":"Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, New York (2004)"},{"issue":"8","key":"10_CR2","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/j.ic.2007.01.009","volume":"205","author":"E Fersman","year":"2007","unstructured":"Fersman, E., Krcal, P., Pettersson, P., Wang, Y.: Task automata: schedulability, decidability and undecidability. Inform. Comput. 205(8), 1149\u20131172 (2007)","journal-title":"Inform. Comput."},{"issue":"3","key":"10_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D.B., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P.P., Staschulat, J., Stenstr\u00f6m, P.: The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. 7(3), 1\u201353 (2008)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"unstructured":"Ericsson, C., Wall, A., Wang, Y.: Timed automata as task models for event-driven systems. In: Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications (RTCSA 1999), pp. 182\u2013189. IEEE Computer Society (1999)","key":"10_CR4"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-40229-6_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2013","unstructured":"Li, G., Cai, X., Ogawa, M., Yuen, S.: Nested timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 168\u2013182. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40229-6_12"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-22975-1_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G Li","year":"2015","unstructured":"Li, G., Ogawa, M., Yuen, S.: Nested timed automata with frozen clocks. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 189\u2013205. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-22975-1_13"},{"issue":"2","key":"10_CR7","first-page":"51","volume":"24","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Li, G., Yuen, S.: Nested timed automata with various clocks. Sci. Found. China 24(2), 51\u201368 (2016)","journal-title":"Sci. Found. China"},{"issue":"4","key":"10_CR8","first-page":"371","volume":"5","author":"C Choffrut","year":"2000","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. J. Autom. Lang. Comb. 5(4), 371\u2013404 (2000)","journal-title":"J. Autom. Lang. Comb."},{"doi-asserted-by":"crossref","unstructured":"Altisen, K., G\u00f6ssler, G., Pnueli, A., Sifakis, J., Tripakis, S., Yovine, S.: A framework for scheduler synthesis. In: Proceedings of the 20th IEEE Real-Time Systems Symposium (RTSS 1999), pp. 154\u2013163. IEEE Computer Society (1999)","key":"10_CR9","DOI":"10.1109\/REAL.1999.818838"},{"doi-asserted-by":"crossref","unstructured":"Abdeddam, Y., Maler, O.: Job-Shop Scheduling Using Timed Automata? Springer, Berlin (2001)","key":"10_CR10","DOI":"10.1007\/3-540-44585-4_46"},{"doi-asserted-by":"crossref","unstructured":"Fehnker, A.: Scheduling a steel plant with timed automata. In: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications, pp. 280\u2013286 (1999)","key":"10_CR11","DOI":"10.1109\/RTCSA.1999.811256"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-46002-0_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Fersman","year":"2002","unstructured":"Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processes: schedulability and decidability. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 67\u201382. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46002-0_6"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-15643-4_23","volume-title":"Automated Technology for Verification and Analysis","author":"A Trivedi","year":"2010","unstructured":"Trivedi, A., Wojtczak, D.: Recursive timed automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 306\u2013324. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15643-4_23"},{"doi-asserted-by":"crossref","unstructured":"Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines. In: Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME 2010), pp. 61\u201368. IEEE Computer Society (2010)","key":"10_CR14","DOI":"10.1109\/TIME.2010.10"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2016.02.021","volume":"625","author":"M Benerecetti","year":"2016","unstructured":"Benerecetti, M., Peron, A.: Timed recursive state machines: expressiveness and complexity. Theor. Comput. Sci. 625, 85\u2013124 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"TA Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inform. Comput. 111(2), 193\u2013244 (1994)","journal-title":"Inform. Comput."},{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012), pp. 35\u201344. IEEE Computer Society (2012)","key":"10_CR18","DOI":"10.1109\/LICS.2012.15"},{"key":"10_CR19","volume-title":"Automata and Computability","author":"DC Kozen","year":"1951","unstructured":"Kozen, D.C.: Automata and Computability. Springer, New York (1951)"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering: Theories, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47677-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:24:23Z","timestamp":1498335863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47677-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319476766","9783319476773"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47677-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}