{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:56Z","timestamp":1725573896193},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204619"},{"type":"electronic","value":"9783540398936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39893-6_28","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:35:57Z","timestamp":1294414557000},"page":"491-503","source":"Crossref","is-referenced-by-count":20,"title":["On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata"],"prefix":"10.1007","author":[{"given":"Johan","family":"Bengtsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45510-8_4","volume-title":"Modeling and Verification of Parallel Processes","author":"T. Amnell","year":"2001","unstructured":"Amnell, T., Behrmann, G., Bengtsson, J., D\u2019Argenio, P.R., David, A., Fehnker, A., Hune, T., Jeannet, B., Larsen, K.G., M\u00f6ller, M.O., Pettersson, P., Weise, C., Yi, W.: UPPAAL - Now, Next, and Future. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 100\u2013125. Springer, Heidelberg (2001)"},{"issue":"2","key":"28_CR2","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. Journal of Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Journal of Theoretical Computer Science"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B. B\u00e9rard","year":"1998","unstructured":"B\u00e9rard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae\u00a036, 145\u2013182 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"28_CR4","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-61042-1_66","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Bengtsson","year":"1996","unstructured":"Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Uppaal in 1995. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 431\u2013434. Springer, Heidelberg (1996)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D.L. Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020947","volume-title":"Hybrid Systems III","author":"C. Daws","year":"1996","unstructured":"Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool kronos. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol.\u00a01066. Springer, Heidelberg (1996)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proceedings of the London Mathematical Society. Ser. 3, vol.\u00a02, pp. 326\u2013336 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. In: Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 394\u2013406 (1992)","DOI":"10.1109\/LICS.1992.185551"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Technical Report TR94-1404, Cornell Computer Science Technical Report Collection (1994)","DOI":"10.1006\/inco.1994.1045"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/REAL.1995.495198","volume-title":"Proc. of the 16th IEEE Real-Time Systems Symposium","author":"K.G. Larsen","year":"1995","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Compositional and Symbolic Model-Checking of Real-Time Systems. In: Proc. of the 16th IEEE Real-Time Systems Symposium, December 1995, pp. 76\u201387. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Petterson, P., Yi, W.: Uppaal in a nutshell. Journal on Software Tools for Technology Transfer (1997)","DOI":"10.1007\/s100090050010"},{"key":"28_CR13","unstructured":"Pettersson, P.: Modelling and Verification of Real-Time Systems Using Timed Automata: Theory and Practice. PhD thesis, Uppsala University (1999)"},{"key":"28_CR14","unstructured":"Rokicki, T.G.: Representing and Modeling Digital Circuits. PhD thesis, Stanford University (1993)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-56922-7_18","volume-title":"Computer Aided Verification","author":"M. Yannakakis","year":"1993","unstructured":"Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 210\u2013224. Springer, Heidelberg (1993)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Yovine, S.: Kronos: A verification tool for real-time systems. Journal on Software Tools for Technology Transfer 1 (October 1997)","DOI":"10.1007\/s100090050009"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-65193-4_20","volume-title":"Lectures on Embedded Systems","author":"S. Yovine","year":"1998","unstructured":"Yovine, S.: Model checking timed automata. In: Rozenberg, G. (ed.) EEF School 1996. LNCS, vol.\u00a01494, pp. 114\u2013152. Springer, Heidelberg (1998)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Yi, W., Petterson, P., Daniels, M.: Automatic verification of real-time communicating systems by constraint-solving. In: Proceedings, Seventh International Conference on Formal Description Techniques, pp. 223\u2013238 (1994)","DOI":"10.1007\/978-0-387-34878-0_18"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39893-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:37:19Z","timestamp":1637116639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39893-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204619","9783540398936"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39893-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}