{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T11:18:48Z","timestamp":1789816728878,"version":"4.0.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319657646","type":"print"},{"value":"9783319657653","type":"electronic"}],"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-65765-3_4","type":"book-chapter","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T05:08:38Z","timestamp":1501650518000},"page":"58-73","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Reachability in Cost Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Hanifa","family":"Boucheneb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Didier","family":"Lime","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baptiste","family":"Parquier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier H.","family":"Roux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charlotte","family":"Seidner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Mayr, R.: Priced timed petri nets. Logical Methods Comput. Sci. 9(4) (2013)","DOI":"10.2168\/LMCS-9(4:10)2013"},{"issue":"3","key":"4_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.tcs.2003.10.038","volume":"318","author":"R Alur","year":"2004","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. Theoret. Comput. Sci. 318(3), 297\u2013322 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced time automata. In: Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147\u2013161. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45351-2_15"},{"issue":"4","key":"4_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1059816.1059823","volume":"32","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev. 32(4), 34\u201340 (2005)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B Berthomieu","year":"1991","unstructured":"Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time petri nets. IEEE Trans. Software Eng. 17(3), 259\u2013273 (1991)","journal-title":"IEEE Trans. Software Eng."},{"key":"4_CR6","unstructured":"Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time petri nets. In: IFIP Congress, pp. 41\u201346 (1983)"},{"issue":"4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3166\/tsi.22.435-459","volume":"22","author":"H Boucheneb","year":"2003","unstructured":"Boucheneb, H., Mullins, J.: Analyse des r\u00e9seaux temporels: calcul des classes en $$O(n^2)$$ et des temps de chemin en $$O(m\\times n)$$ . TSI. Technique et science informatiques 22(4), 435\u2013459 (2003)","journal-title":"TSI. Technique et science informatiques"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.scico.2016.08.008","volume":"132","author":"PA Bourdil","year":"2016","unstructured":"Bourdil, P.A., Berthomieu, B., Dal Zilio, S., Vernadat, F.: Symmetry reduction for time petri net state classes. Sci. Comput. Program. 132, 209\u2013225 (2016)","journal-title":"Sci. Comput. Program."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-41528-4_28","volume-title":"Computer Aided Verification","author":"P Bouyer","year":"2016","unstructured":"Bouyer, P., Colange, M., Markey, N.: Symbolic optimal reachability in weighted timed automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 513\u2013530. Springer, Cham (2016). doi: 10.1007\/978-3-319-41528-4_28"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). doi: 10.1007\/3-540-52148-8_17"},{"key":"4_CR11","unstructured":"EPOC. Energy proportional and opportunistic computing systems. http:\/\/www.epoc.cominlabs.ueb.eu\/fr"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K Larsen","year":"2001","unstructured":"Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: effcient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 493\u2013505. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44585-4_47"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-00768-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Lime","year":"2009","unstructured":"Lime, D., Roux, O.H., Seidner, C., Traonouez, L.-M.: Romeo: a parametric model-checker for petri nets with stopwatches. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 54\u201357. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00768-2_6"},{"issue":"4","key":"4_CR14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1013952225669","volume":"18","author":"A Marcone","year":"2001","unstructured":"Marcone, A.: Fine analysis of the quasi-orderings on the power set. Order 18(4), 339\u2013347 (2001)","journal-title":"Order"},{"issue":"1","key":"4_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10703-006-0014-1","volume":"29","author":"JI Rasmussen","year":"2006","unstructured":"Rasmussen, J.I., Larsen, K.G., Subramani, K.: On using priced timed automata to achieve optimal scheduling. Formal Methods Syst. Des. 29(1), 97\u2013114 (2006)","journal-title":"Formal Methods Syst. Des."}],"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-65765-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T19:16:29Z","timestamp":1569957389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65765-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319657646","9783319657653"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65765-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}