{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:31Z","timestamp":1725514771732},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_44","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T09:39:35Z","timestamp":1213090775000},"page":"407-416","source":"Crossref","is-referenced-by-count":0,"title":["Updatable Timed Automata with Additive and Diagonal Constraints"],"prefix":"10.1007","author":[{"given":"Lakshmi","family":"Manasa","sequence":"first","affiliation":[]},{"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[]},{"given":"Kumar","family":"Nagaraj","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science\u00a0126(2) (1994)","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic Symbolic Verification of Embedded Systems. IEEE Transactions on Software Engineering\u00a022, 181\u2013201 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(94)00228-B","volume":"138","author":"E. Asarin","year":"1995","unstructured":"Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical sytems having piecewise-constant derivatives. Theoretical Computer Science\u00a0138, 35\u201365 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"44_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Duford, C., Fleury, E., Petit, A.: Updatable Timed Automata. Theoretical Computer Science\u00a0321(2-3), 291\u2013345 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(00)00075-2","volume":"75","author":"B. B\u00e9rard","year":"2000","unstructured":"B\u00e9rard, B., Duford, C.: Timed automata and additive clock constraints. Information Processing Letters\u00a075(1-2), 1\u20137 (2000)","journal-title":"Information Processing Letters"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-61780-9","volume-title":"STACS 96","author":"B. B\u00e9rard","year":"1996","unstructured":"B\u00e9rard, B., Gastin, P., Petit, A.: On the power of non observable actions in timed automata. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 257\u2013268. Springer, Heidelberg (1996)"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0055641","volume-title":"CONCUR \u201998 Concurrency Theory","author":"F. Demichelis","year":"1998","unstructured":"Demichelis, F., Zielonka, W.: Controlled Timed Automata. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 455\u2013469. Springer, Heidelberg (1998)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Behrmann, G., David, A., Larsen, K.G., Mller, O., Pettersson, P., Yi, W.: Uppaal - Present and Future. In: Proceedings of the 40th IEEE Conference on Decision and Control, Orlando, Florida, USA, December 4-7, 2001 (2001)","DOI":"10.1109\/CDC.2001.980713"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The Tool KRONOS, Hybrid Systems, pp. 208\u2013219 (1995)","DOI":"10.1007\/BFb0020947"},{"key":"44_CR10","unstructured":"Lakshmi Manasa, G., Krishna, S.N., Nagaraj, K.: Updatable Timed automata, Technical Report, http:\/\/www.cse.iitb.ac.in\/krishnas\/uta.pdf"},{"key":"44_CR11","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, USA (1967)"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:37Z","timestamp":1620002317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_44","relation":{},"subject":[]}}