乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T07:10:09Z","timestamp":1726125009354},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491218"},{"type":"electronic","value":"9783662491225"}],"license":[{"start":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T00:00:00Z","timestamp":1451001600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T00:00:00Z","timestamp":1451001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49122-5_12","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T05:01:36Z","timestamp":1450933296000},"page":"250-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lipschitz Robustness of Timed I\/O Systems"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[]},{"given":"Jan","family":"Otop","sequence":"additional","affiliation":[]},{"given":"Roopsha","family":"Samanta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bloem, R., Greimel, K., Henzinger, T., Jobstmann, B.: Synthesizing robust systems. In: Formal Methods in Computer Aided Design (FMCAD), pp. 85\u201392 (2009)","DOI":"10.1109\/FMCAD.2009.5351139"},{"issue":"2","key":"12_CR4","first-page":"135","volume":"31","author":"P Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On the optimal reachability problem on weighted timed automata. FMSD 31(2), 135\u2013175 (2007)","journal-title":"FMSD"},{"key":"12_CR5","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)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-15375-4_18","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 253\u2013268. Springer, Heidelberg (2010)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity analysis of programs. In: Principles of Programming Languages (POPL), pp. 57\u201370 (2010)","DOI":"10.1145\/1707801.1706308"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving programs robust. In: Foundations of Software Engineering (FSE), pp. 102\u2013112 (2011)","DOI":"10.1145\/2025113.2025131"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T.A., Legay, A., Ni\u010dkovi\u0107, D.: Robustness of sequential circuits. In: Application of Concurrency to System Design (ACSD), pp. 77\u201384 (2010)","DOI":"10.1109\/ACSD.2010.26"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 331\u2013345. Springer, Heidelberg (1997)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"3727","DOI":"10.1098\/rsta.2008.0141","volume":"366","author":"TA Henzinger","year":"2008","unstructured":"Henzinger, T.A.: Two challenges in embedded systems design: predictability and robustness. Philos. Trans. R. Soc. 366, 3727\u20133736 (2008)","journal-title":"Philos. Trans. R. Soc."},{"key":"12_CR12","unstructured":"Henzinger, T.A., Otop, J., Samanta, R.: Lipschitz robustness of finite-state transducers. In: FSTTCS 2014, vol. 1, p. 431 (2014)"},{"key":"12_CR13","volume-title":"Robust and Optimal Control","author":"K Zhou","year":"1996","unstructured":"Zhou, K., Doyle, J.C., Glover, K.: Robust and Optimal Control. Prentice Hall, Upper Saddle River (1996)"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s10703-009-0065-1","volume":"34","author":"M Krichen","year":"2009","unstructured":"Krichen, M., Tripakis, S.: Conformance testing for real-time systems. Form. Methods Syst. Des. 34(3), 238\u2013304 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-52292-1_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Lozano","year":"1990","unstructured":"Lozano, A., Balc\u00e1zar, J.L.: The complexity of graph problems for succinctly represented graphs. Graph-Theoretic Concepts in Computer Science. LNCS, vol. 411, pp. 277\u2013286. Springer, Heidelberg (1990)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2539036.2539044","volume":"13","author":"R Majumdar","year":"2013","unstructured":"Majumdar, R., Render, E., Tabuada, P.: A theory of robust omega-regular software synthesis. ACM Trans. Embed. Comput. Syst. 13, 1\u201327 (2013)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Saha, I.: Symbolic robustness analysis. In: IEEE Real-Time Systems Symposium, pp. 355\u2013363 (2009)","DOI":"10.1109\/RTSS.2009.17"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-35873-9_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Samanta","year":"2013","unstructured":"Samanta, R., Deshmukh, J.V., Chaudhuri, S.: Robustness analysis of networked systems. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 229\u2013247. Springer, Heidelberg (2013)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-02444-8_30","volume-title":"Automated Technology for Verification and Analysis","author":"R Samanta","year":"2013","unstructured":"Samanta, R., Deshmukh, J.V., Chaudhuri, S.: Robustness analysis of string transducers. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 427\u2013441. Springer, Heidelberg (2013)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-40229-6_15","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C Stergiou","year":"2013","unstructured":"Stergiou, C., Tripakis, S., Matsikoudis, E., Lee, E.A.: On the verification of timed discrete-event models. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 213\u2013227. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49122-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:25:03Z","timestamp":1559363103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49122-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,25]]},"ISBN":["9783662491218","9783662491225"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49122-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,25]]},"assertion":[{"value":"25 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}