{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:26Z","timestamp":1725798686946},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319105116"},{"type":"electronic","value":"9783319105123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10512-3_4","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T01:20:44Z","timestamp":1407720044000},"page":"38-52","source":"Crossref","is-referenced-by-count":2,"title":["Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices"],"prefix":"10.1007","author":[{"given":"Omar","family":"Al-Bataineh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Reynolds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"French","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS, 183\u2013235 (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Radek, P.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf., 204\u2013215 (2006)","DOI":"10.1007\/s10009-005-0190-0"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.: Efficient Guiding Towards Cost-Optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11603009_7","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G. Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Beyond liveness: Efficient parameter synthesis for time bounded liveness. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 81\u201394. Springer, Heidelberg (2005)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J.E. Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Form. Methods Syst. Des.\u00a024, 281\u2013320 (2004)","journal-title":"Form. Methods Syst. Des."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1145\/937555.937558","volume":"4","author":"J. Bryans","year":"2003","unstructured":"Bryans, J., Bowman, H., Derrick, J.: Model checking stochastic automata. ACM Transactions on Computational Logic (TOCL)\u00a04(4), 452\u2013492 (2003)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"4_CR9","unstructured":"Dalsgaard, A.E., Olesen, M.C., Toft, M., Hansen, R.R., Larsen, K.G.: METAMOC: Modular Execution Time Analysis using Model Checking. In: WCET 2010, pp. 113\u2013123 (2010)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20398-5_37","volume-title":"NASA Formal Methods","author":"A.E. Dalsgaard","year":"2011","unstructured":"Dalsgaard, A.E., Hansen, R.R., J\u00f8rgensen, K.Y., Larsen, K.G., Olesen, M.C., Olsen, P., Srba, J.: opaal: A lattice model checker. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 487\u2013493. Springer, Heidelberg (2011)"},{"key":"4_CR11","unstructured":"Daws, C., Yovine, S.: Two examples of verification of multirate timed automata with kronos. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, RTSS 1995. IEEE Computer Society (1995)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, pp. 197\u2013212. Springer-Verlag New York, Inc. (1990)","DOI":"10.1007\/3-540-52148-8_17"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Communications of the ACM (1962)","DOI":"10.1145\/367766.368168"},{"key":"4_CR14","unstructured":"Herbreteau, F., Kini, D., Srivathsan, B., Walukiewicz, I.: Using non-convex approximations for efficient analysis of timed automata. In: FSTTCS (2011)"},{"issue":"7","key":"4_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.peva.2011.11.002","volume":"69","author":"A. Horv\u00e1th","year":"2012","unstructured":"Horv\u00e1th, A., Paolieri, M., Ridi, L., Vicario, E.: Transient analysis of non-markovian models using stochastic state classes. Performance Evaluation\u00a069(7), 315\u2013335 (2012)","journal-title":"Performance Evaluation"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27813-9_26","volume-title":"Computer Aided Verification","author":"A. Metzner","year":"2004","unstructured":"Metzner, A.: Why model checking can improve WCET analysis. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 334\u2013347. Springer, Heidelberg (2004)"},{"key":"4_CR17","unstructured":"Rokicki, T.G.: Representing and Modeling Digital Circuits. PhD thesis, Stanford University (1993)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85778-5_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"L.-M. Traonouez","year":"2008","unstructured":"Traonouez, L.-M., Lime, D., Roux, O.H.: Parametric model-checking of time petri nets with stopwatches using the state-class graph. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 280\u2013294. Springer, Heidelberg (2008)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-24622-0_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Wilhelm","year":"2004","unstructured":"Wilhelm, R.: Why AI + ILP is good for WCET, but MC is not, nor ILP alone. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 309\u2013322. Springer, Heidelberg (2004)"}],"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\/978-3-319-10512-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:39:37Z","timestamp":1558953577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10512-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319105116","9783319105123"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10512-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}