{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:43:22Z","timestamp":1725615802596},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243714"},{"type":"electronic","value":"9783642243721"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24372-1_26","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T09:41:14Z","timestamp":1317289274000},"page":"366-380","source":"Crossref","is-referenced-by-count":19,"title":["A Succinct Canonical Register Automaton Model"],"prefix":"10.1007","author":[{"given":"Sofia","family":"Cassel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maik","family":"Merten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/S0022-0000(03)00032-1","volume":"66","author":"N. Alon","year":"2003","unstructured":"Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: typechecking revisited. J. Comput. Syst. Sci.\u00a066(4), 688\u2013727 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_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.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"26_CR3","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: Proc. 4th Alberto Mendelzon Int. Workshop on Foundations of Data Management, Buenos Aires, Argentina. CEUR Workshop Proceedings, vol.\u00a0619 (2010)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-78743-3_24","volume-title":"Fundamental Approaches to Software Engineering","author":"T. Berg","year":"2008","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol.\u00a04961, pp. 317\u2013331. Springer, Heidelberg (2008)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/3-540-45465-9_65","volume-title":"Automata, Languages and Programming","author":"M. Bielecki","year":"2002","unstructured":"Bielecki, M., Hidders, J., Paredaens, J., Tyszkiewicz, J., den Bussche, J.V.: Navigating with a browser. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 764\u2013775. Springer, Heidelberg (2002)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theoretical Computer Science\u00a0411, 702\u2013715 (2010)","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: Data monoids. In: STACS, pp. 105\u2013116 (2011)","DOI":"10.1145\/2430532.2364520"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Transactions on Computational Logic (to appear, 2011)","DOI":"10.1145\/1970398.1970403"},{"key":"26_CR9","first-page":"200","volume":"84","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P.: A logical characterization of data languages. Information Processing Letters\u00a084, 200\u2013202 (2001)","journal-title":"Information Processing Letters"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. Information and Computation\u00a0182(2), 137\u2013162 (2003)","journal-title":"Information and Computation"},{"issue":"1-3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(03)00246-9","volume":"306","author":"N. Francez","year":"2003","unstructured":"Francez, N., Kaminski, M.: An algebraic characterization of deterministic regular languages over infinite alphabets. Theoretical Computer Science\u00a0306(1-3), 155\u2013175 (2003)","journal-title":"Theoretical Computer Science"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"key":"26_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Issarny, V., Steffen, B., Jonsson, B., Blair, G.S., Grace, P., Kwiatkowska, M.Z., Calinescu, R., Inverardi, P., Tivoli, M., Bertolino, A., Sabetta, A.: CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. In: ICECCS, pp. 154\u2013161 (2009)","DOI":"10.1109\/ICECCS.2009.44"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"Kanellakis, P., Smolka, S.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-44618-4_41","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Lazic","year":"2000","unstructured":"Lazic, R., Nowak, D.: A unifying approach to data-independence. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 581\u2013595. Springer, Heidelberg (2000)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-24727-2_25","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Maler","year":"2004","unstructured":"Maler, O., Pnueli, A.: On recognizable timed languages. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 348\u2013362. Springer, Heidelberg (2004)"},{"issue":"4","key":"26_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear Automaton Transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"6","key":"26_CR20","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TSE.2004.1265734","volume":"30","author":"A. Petrenko","year":"2004","unstructured":"Petrenko, A., Boroday, S., Groz, R.: Confirming configurations in EFSM testing. IEEE Trans. on Software Engineering\u00a030(1), 29\u201342 (2004)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Saint-Andre, P.: Extensible Messaging and Presence Protocol (XMPP): Instant Messaging and Presence. RFC 6121 (Proposed Standard) (March 2011)","DOI":"10.17487\/rfc6121"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T. Wilke","year":"1994","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24372-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T04:28:13Z","timestamp":1686371293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24372-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243714","9783642243721"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24372-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}