{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:28:57Z","timestamp":1725701337875},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329425"},{"type":"electronic","value":"9783642329432"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_1","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T00:59:35Z","timestamp":1346115575000},"page":"1-15","source":"Crossref","is-referenced-by-count":0,"title":["Symbolically Bounding the Drift in Time-Constrained MSC Graphs"],"prefix":"10.1007","author":[{"given":"S.","family":"Akshay","sequence":"first","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]},{"given":"Shaofa","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"14-15","key":"1_CR1","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ipl.2012.05.002","volume":"112","author":"S. Akshay","year":"2012","unstructured":"Akshay, S., Genest, B., H\u00e9lou\u00ebt, L., Yang, S.: Regular set of representatives for time-constrained MSC graphs. Inf. Proc. Letters\u00a0112(14-15), 592\u2013598 (2012)","journal-title":"Inf. Proc. Letters"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74407-8_13","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"S. Akshay","year":"2007","unstructured":"Akshay, S., Mukund, M., Kumar, K.N.: Checking Coverage for Infinite Collections of Timed Scenarios. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 181\u2013196. Springer, Heidelberg (2007)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-77050-3_24","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S. Akshay","year":"2007","unstructured":"Akshay, S., Gastin, P., Kumar, N.K., Mukund, M.: Model Checking Time-Constrained Scenario-based Specifications. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 290\u2013302. Springer, Heidelberg (2007)"},{"issue":"2","key":"1_CR4","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. Theoretical Comp. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Comp. Sci."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999. Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-540-39893-6_28","volume-title":"Formal Methods and Software Engineering","author":"J.E. Bengtsson","year":"2003","unstructured":"Bengtsson, J.E., Yi, W.: On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol.\u00a02885, pp. 491\u2013503. Springer, Heidelberg (2003)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11901914_23","volume-title":"Automated Technology for Verification and Analysis","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Haddad, S., Reynier, P.-A.: Timed Unfoldings for Networks of Timed Automata. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 292\u2013306. Springer, Heidelberg (2006)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11901914_24","volume-title":"Automated Technology for Verification and Analysis","author":"F. Cassez","year":"2006","unstructured":"Cassez, F., Chatain, T., Jard, C.: Symbolic Unfoldings for Networks of Timed Automata. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 307\u2013321. Springer, Heidelberg (2006)"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"G. Dantzig","year":"1973","unstructured":"Dantzig, G., Eaves, B.C.: Fourier-Motzkin Elimination and Its Dual. J. Comb. Theory, Ser. A\u00a014(3), 288\u2013297 (1973)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-75292-9_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"C. Dima","year":"2007","unstructured":"Dima, C., Lanotte, R.: Distributed Time-Asynchronous Automata. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol.\u00a04711, pp. 185\u2013200. Springer, Heidelberg (2007)"},{"key":"1_CR11","unstructured":"Gastin, P., Kumar, K.N., Mukund, M.: Reachability and boundedness in time-constrained MSC graphs. In: Perspectives in Concurrency \u2013 A Festschrift for P. S. Thiagarajan. Universities Press, India (2009)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"J.G. Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Inf. and Comp.\u00a0202(1), 1\u201338 (2005)","journal-title":"Inf. and Comp."},{"key":"1_CR13","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC 1999) (1999)"},{"key":"1_CR14","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 3rd edn. Springer (2006)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2005.07.023","volume":"345","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. Theoretical Comp. Sci.\u00a0345(1), 27\u201359 (2005)","journal-title":"Theoretical Comp. Sci."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Mathematical Foundations of Computer Science 1999","author":"A. Muscholl","year":"1999","unstructured":"Muscholl, A., Peled, D.: Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 81\u201391. Springer, Heidelberg (1999)"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1145\/322276.322288","volume":"28","author":"R. Shostak","year":"1981","unstructured":"Shostak, R.: Deciding linear inequalities by computing loop residues. JACM\u00a028(4), 769\u2013779 (1981)","journal-title":"JACM"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45739-9_24","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J. Zhao","year":"2002","unstructured":"Zhao, J., Xu, H., Li, X., Zheng, T., Zheng, G.: Partial Order Path Technique for Checking Parallel Timed Automata. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, pp. 417\u2013432. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:15:01Z","timestamp":1558300501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}