{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:10Z","timestamp":1745964610169,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_2","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:37:23Z","timestamp":1361216243000},"page":"17-33","source":"Crossref","is-referenced-by-count":8,"title":["History-Register Automata"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Tzevelekos","sequence":"first","affiliation":[]},{"given":"Radu","family":"Grigore","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L., Stark, I.D.B.: Nominal games and full abstraction for the nu-calculus. In: LICS, pp. 150\u2013159 (2004)","DOI":"10.1109\/LICS.2004.1319609"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T. Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theor. Comput. Sci.\u00a03(1), 85\u2013104 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Log. Meth. Comput. Sci.\u00a07(4) (2011)","DOI":"10.2168\/LMCS-7(4:4)2011"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11417170_8","volume-title":"Typed Lambda Calculi and Applications","author":"N. Benton","year":"2005","unstructured":"Benton, N., Leperchey, B.: Relational Reasoning in a Nominal Semantics for Storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 86\u2013101. Springer, Heidelberg (2005)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. TCS\u00a0411 (2010)","DOI":"10.1016\/j.tcs.2009.10.009"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316 (2006)","DOI":"10.1109\/LICS.2006.51"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-73368-3_24","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2007","unstructured":"Bouajjani, A., Fratani, S., Qadeer, S.: Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 207\u2013220. Springer, Heidelberg (2007)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-58152-9_11","volume-title":"Application and Theory of Petri Nets 1994","author":"G. Ciardo","year":"1994","unstructured":"Ciardo, G.: Petri Nets with Marking-Dependent Arc Cardinality. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol.\u00a0815, pp. 179\u2013198. Springer, Heidelberg (1994)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. TOCL 10(3) (2009)","DOI":"10.1145\/1507244.1507246"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: LICS, pp. 269\u2013278 (2011)","DOI":"10.1109\/LICS.2011.39"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-11266-9_33","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"A. Finkel","year":"2010","unstructured":"Finkel, A., Sangnier, A.: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 394\u2013406. Springer, Heidelberg (2010)"},{"issue":"3-5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput.\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Asp. Comput."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: TACAS (to appear 2013)","DOI":"10.1007\/978-3-642-36742-7_19"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jancar","year":"1995","unstructured":"Jancar, P.: Undecidability of bisimilarity for Petri nets and some related problems. Theor. Comput. Sci.\u00a0148(2), 281\u2013301 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","unstructured":"Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: LICS (1999)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-32940-1_35","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A. Kaiser","year":"2012","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Efficient Coverability Analysis by Proof Minimization. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 500\u2013515. Springer, Heidelberg (2012), http:\/\/www.cprover.org\/bfc\/"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci.\u00a0134(2) (1994)","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-73420-8_58","volume-title":"Automata, Languages and Programming","author":"J. Laird","year":"2007","unstructured":"Laird, J.: A Fully Abstract Trace Semantics for General References. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 667\u2013679. Springer, Heidelberg (2007)"},{"issue":"3","key":"2_CR20","first-page":"251","volume":"88","author":"R. Lazic","year":"2008","unstructured":"Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform.\u00a088(3), 251\u2013274 (2008)","journal-title":"Fundam. Inform."},{"key":"2_CR21","unstructured":"Lipton, R.: The reachability problem requires exponential space. Tech. Rep. 62, Yale (1976)"},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1142\/S0129054111008465","volume":"22","author":"A. Manuel","year":"2011","unstructured":"Manuel, A., Ramanujam, R.: Class counting automata on datawords. Int. J. Found. Comput. Sci.\u00a022(4), 863\u2013882 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: An introduction to History Dependent Automata. Electr. Notes Theor. Comput. Sci.\u00a010 (1997)","DOI":"10.1016\/S1571-0661(05)80696-6"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-19718-5_22","volume-title":"Programming Languages and Systems","author":"A.S. Murawski","year":"2011","unstructured":"Murawski, A.S., Tzevelekos, N.: Algorithmic Nominal Game Semantics. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol.\u00a06602, pp. 419\u2013438. Springer, Heidelberg (2011)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-642-31585-5_30","volume-title":"ICALP 2012","author":"A.S. Murawski","year":"2012","unstructured":"Murawski, A.S., Tzevelekos, N.: Algorithmic Games for Full Ground References. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 312\u2013324. Springer, Heidelberg (2012)"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans.\u00a0Comput.\u00a0Logic\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Trans.\u00a0Comput.\u00a0Logic"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A.M. Pitts","year":"1993","unstructured":"Pitts, A.M., Stark, I.: Observable Properties of Higher Order Functions that Dynamically Create Local Names, or: What\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 122\u2013141. Springer, Heidelberg (1993)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. TCS (1978)","DOI":"10.1016\/0304-3975(78)90036-1"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"L.E. Rosier","year":"1986","unstructured":"Rosier, L.E., Yen, H.-C.: A multiparameter analysis of the boundedness problem for vector addition systems. J.\u00a0Comput.\u00a0Syst.\u00a0Sci.\u00a032(1), 105\u2013135 (1986)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sci."},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"},{"key":"2_CR31","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":"2_CR32","unstructured":"Stark, I.: Names and higher-order functions. PhD thesis, University of Cambridge (1994)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: POPL, pp. 295\u2013306 (2011)","DOI":"10.1145\/1925844.1926420"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:32:44Z","timestamp":1745962364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}