{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:30:02Z","timestamp":1760369402702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319671123"},{"type":"electronic","value":"9783319671130"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67113-0_7","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T00:21:24Z","timestamp":1503534084000},"page":"100-115","source":"Crossref","is-referenced-by-count":5,"title":["A Unified Formalism for Monoprocessor Schedulability Analysis Under Uncertainty"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46002-0_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Abdedda\u00efm","year":"2002","unstructured":"Abdedda\u00efm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 113\u2013126. Springer, Heidelberg (2002). doi:\n10.1007\/3-540-46002-0_9"},{"issue":"2","key":"7_CR2","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."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592\u2013601. ACM (1993)","DOI":"10.1145\/167088.167242"},{"key":"7_CR4","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-29510-7_3","volume-title":"Formal Techniques for Safety-Critical Systems","author":"\u00c9 Andr\u00e9","year":"2016","unstructured":"Andr\u00e9, \u00c9.: What\u2019s decidable about parametric timed automata? In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2015. CCIS, vol. 596, pp. 52\u201368. Springer, Cham (2016). doi:\n10.1007\/978-3-319-29510-7_3"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-32759-9_6","volume-title":"FM 2012: Formal Methods","author":"\u00c9 Andr\u00e9","year":"2012","unstructured":"Andr\u00e9, \u00c9., Fribourg, L., K\u00fchne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33\u201336. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32759-9_6"},{"key":"7_CR6","unstructured":"Andr\u00e9, \u00c9., Lipari, G., Sun, Y.: Verification of two real-time systems using parametric timed automata. In: WATERS (2015)"},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The parma polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008)","journal-title":"Sci. Comput. Program."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-41036-9_7","volume-title":"Reachability Problems","author":"B B\u00e9rard","year":"2013","unstructured":"B\u00e9rard, B., Haddad, S., Jovanovi\u0107, A., Lime, D.: Parametric interrupt timed automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 59\u201369. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-41036-9_7"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-41036-9_1","volume-title":"Reachability Problems","author":"P Bouyer","year":"2013","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robustness in timed automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 1\u201318. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-41036-9_1"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-44618-4_12","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"F Cassez","year":"2000","unstructured":"Cassez, F., Larsen, K.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138\u2013152. Springer, Heidelberg (2000). doi:\n10.1007\/3-540-44618-4_12"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS, pp. 80\u201389. IEEE Computer Society (2008)","DOI":"10.1109\/RTSS.2008.36"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-47677-3_10","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"B Fang","year":"2016","unstructured":"Fang, B., Li, G., Sun, D., Cai, H.: Schedulability analysis of timed regular tasks by under-approximation on WCET. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 147\u2013162. Springer, Cham (2016). doi:\n10.1007\/978-3-319-47677-3_10"},{"issue":"8","key":"7_CR13","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., Krc\u00e1l, P., Pettersson, P., Yi, W.: Task automata: schedulability, decidability and undecidability. Inf. Comput. 205(8), 1149\u20131172 (2007)","journal-title":"Inf. Comput."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S1567-8326(02)00037-1","volume":"52\u201353","author":"T Hune","year":"2002","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. J. Logic Algebr. Program. 52\u201353, 183\u2013220 (2002)","journal-title":"J. Logic Algebr. Program."},{"issue":"5","key":"7_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TSE.2014.2357445","volume":"41","author":"A Jovanovi\u0107","year":"2015","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. IEEE Trans. Softw. Eng. 41(5), 445\u2013461 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-46430-1_26","volume-title":"Hybrid Systems: Computation and Control","author":"JS Miller","year":"2000","unstructured":"Miller, J.S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 296\u2013310. Springer, Heidelberg (2000). doi:\n10.1007\/3-540-46430-1_26"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Norstr\u00f6m, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: RTCSA, pp. 182\u2013189. IEEE Computer Society (1999)","DOI":"10.1109\/RTCSA.1999.811218"},{"key":"7_CR18","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-05416-2_14","volume-title":"Formal Techniques for Safety-Critical Systems","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Soulat, R., Lipari, G., Andr\u00e9, \u00c9., Fribourg, L.: Parametric schedulability analysis of fixed priority real-time distributed systems. In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2013. CCIS, vol. 419, pp. 212\u2013228. Springer, Cham (2014). doi:\n10.1007\/978-3-319-05416-2_14"}],"container-title":["Lecture Notes in Computer Science","Critical Systems: Formal Methods and Automated Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67113-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T02:37:07Z","timestamp":1508380627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67113-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671123","9783319671130"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67113-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}