{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:42Z","timestamp":1725542922471},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_28","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"421-434","source":"Crossref","is-referenced-by-count":3,"title":["On Finite Alphabets and Infinite Bases III: Simulation"],"prefix":"10.1007","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ic.2004.02.001","volume":"191","author":"L. Aceto","year":"2004","unstructured":"Aceto, L., Fokkink, W., van Glabbeek, R., Ingolfsdottir, A.: Nested semantics over finite trees are equationally hard. Information and Computation\u00a0191(2), 203\u2013232 (2004)","journal-title":"Information and Computation"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/11601548_18","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"L. Aceto","year":"2005","unstructured":"Aceto, L., Fokkink, W., Ingolfsdottir, A., Luttik, B.: Finite Equational Bases in Process Algebra: Results and Open Questions. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 338\u2013367. Springer, Heidelberg (2005)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11787006_42","volume-title":"Automata, Languages and Programming","author":"L. Aceto","year":"2006","unstructured":"Aceto, L., Fokkink, W., Ingolfsdottir, A., Luttik, B.: A Finite Equational Base for CCS with Left Merge and Communication Merge. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 492\u2013503. Springer, Heidelberg (2006)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-45061-0_10","volume-title":"Automata, Languages and Programming","author":"S. Blom","year":"2003","unstructured":"Blom, S., Fokkink, W., Nain, S.: On the axiomatizability of ready traces, ready simulation and failure traces. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 109\u2013118. Springer, Heidelberg (2003)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11690634_1","volume-title":"Foundations of Software Science and Computation Structures","author":"T. Chen","year":"2006","unstructured":"Chen, T., Fokkink, W., Nain, S.: On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/3-540-45022-X_61","volume-title":"Automata, Languages and Programming","author":"W. Fokkink","year":"2000","unstructured":"Fokkink, W., Luttik, B.: An \u03c9-Complete Equational Specification of Interleaving. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 729\u2013743. Springer, Heidelberg (2000)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-24727-2_14","volume-title":"Foundations of Software Science and Computation Structures","author":"W. Fokkink","year":"2004","unstructured":"Fokkink, W., Nain, S.: On finite alphabets and infinite bases: From ready pairs to possible worlds. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 182\u2013194. Springer, Heidelberg (2004)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/11523468_61","volume-title":"Automata, Languages and Programming","author":"W.J. Fokkink","year":"2005","unstructured":"Fokkink, W.J., Nain, S.: A Finite Basis for Failure Semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 755\u2013765. Springer, Heidelberg (2005)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.: The linear time \u2013 branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BFb0039068","volume-title":"CONCUR \u201990","author":"J.F. Groote","year":"1990","unstructured":"Groote, J.F.: A new strategy for proving \u03c9-completeness with applications in process algebra. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 314\u2013331. Springer, Heidelberg (1990)"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(90)90049-8","volume":"49","author":"R. Gurevic\u0306","year":"1990","unstructured":"Gurevic\u0306, R.: Equational theory of positive natural numbers with exponentiation is not finitely axiomatizable. Annals of Pure and Applied Logic\u00a049, 1\u201330 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90173-8","volume":"43","author":"J. Heering","year":"1986","unstructured":"Heering, J.: Partial evaluation and \u03c9-completeness of algebraic specifications. Theoretical Computer Science\u00a043, 149\u2013167 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"28_CR13","doi-asserted-by":"publisher","first-page":"597","DOI":"10.2307\/2321009","volume":"84","author":"L. Henkin","year":"1977","unstructured":"Henkin, L.: The logic of equality. American Mathematical Monthly\u00a084(8), 597\u2013612 (1977)","journal-title":"American Mathematical Monthly"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-46541-3_28","volume-title":"STACS 2000","author":"P. Jancar","year":"2000","unstructured":"Jancar, P., Kucera, A., Moller, F.: Simulation and Bisimulation over One-Counter Processes. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 279\u2013345. Springer, Heidelberg (2000)"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01384078","volume":"7","author":"H. Lin","year":"1995","unstructured":"Lin, H.: PAM: A process algebra manipulator. Formal Methods in System Design\u00a07(3), 243\u2013259 (1995)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0890-5401(90)90033-E","volume":"84","author":"A. Lazrek","year":"1990","unstructured":"Lazrek, A., Lescanne, P., Thiel, J.-J.: Tools for proving inductive equalities, relative completeness, and \u03c9-completeness. Information and Computation\u00a084(1), 47\u201370 (1990)","journal-title":"Information and Computation"},{"issue":"3","key":"28_CR17","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch, N., Tuttle, M.: An introduction to input\/output automata. CWI Quarterly\u00a02(3), 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/1990703","volume":"71","author":"R. Lyndon","year":"1951","unstructured":"Lyndon, R.: Identities in two-valued calculi. Transactions of the American Mathematical Society\u00a071, 457\u2013465 (1951)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/S0218196796000040","volume":"6","author":"R. McKenzie","year":"1996","unstructured":"McKenzie, R.: Tarski\u2019s finite basis problem is undecidable. Journal of Algebra and Computation\u00a06(1), 49\u2013104 (1996)","journal-title":"Journal of Algebra and Computation"},{"key":"28_CR20","unstructured":"McKenzie, R., McNulty, G., Taylor, W.: Algebras, Varieties, Lattices. Wadsworth & Brooks\/Cole (1987)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"28_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"28_CR23","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, University of Edinburgh (1989)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/BFb0032072","volume-title":"Automata, Languages and Programming","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The importance of the left merge operator in process algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 752\u2013764. Springer, Heidelberg (1990)"},{"key":"28_CR25","unstructured":"Murski\u012d, V.L.: The existence in the three-valued logic of a closed class with a finite basis having no finite complete system of identities. Doklady Akademii Nauk SSSR\u00a0163, 815\u2013818 (1965) (in Russian)"},{"key":"28_CR26","unstructured":"Murski\u012d, V.L.: The existence of a finite basis of identities, and other properties of almost all finite algebras In: Problemy Kibernetiki, 30, 43\u201356 (1975) (in Russian)"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"issue":"2","key":"28_CR28","doi-asserted-by":"publisher","first-page":"313","DOI":"10.2307\/2272645","volume":"39","author":"G.D. Plotkin","year":"1974","unstructured":"Plotkin, G.D.: The \u03bb-calculus is \u03c9-incomplete. Journal of Symbolic Logic\u00a039(2), 313\u2013317 (1974)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:29:55Z","timestamp":1619508595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11817949_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}