{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:31Z","timestamp":1725562171703},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_14","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"182-194","source":"Crossref","is-referenced-by-count":4,"title":["On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds"],"prefix":"10.1007","author":[{"given":"Wan","family":"Fokkink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit","family":"Nain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1996.0047","volume":"127","author":"L. Aceto","year":"1996","unstructured":"Aceto, L., Fokkink, W.J., van Glabbeek, R.J., Ing\u00f3lfsd\u00f3ttir, A.: Axiomatizing prefix iteration with silent steps. Information Computation\u00a0127(1), 26\u201340 (1996)","journal-title":"Information Computation"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/S0960129597002491","volume":"8","author":"L. Aceto","year":"1998","unstructured":"Aceto, L., Fokkink, W.J., Ing\u00f3lfsd\u00f3ttir, A.: A menagerie of non-finitely based process semantics over BPA\u2217: From ready simulation to completed traces. Mathematical Structures in Computer Science\u00a08(3), 193\u2013230 (1998)","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44693-1_4","volume-title":"STACS 2001","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W.J., Ing\u00f3lfsd\u00f3ttir, A.: 2-nested simulation is not finitely equationally axiomatizable. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 39\u201350. Springer, Heidelberg (2001)"},{"issue":"6","key":"14_CR4","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Ready-trace semantics for concrete process algebra with the priority operator. The Computer Journal\u00a030(6), 498\u2013506 (1987)","journal-title":"The Computer Journal"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Blom, S.C.C., Fokkink, W.J., 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, Springer, Heidelberg (2003) (to appear)","DOI":"10.1007\/3-540-45061-0_10"},{"key":"14_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.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J., Luttik, S.P.: 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":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-57182-5_39","volume-title":"Mathematical Foundations of Computer Science 1993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 473\u2013484. Springer, Heidelberg (1993)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R.J. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J.: 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":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BFb0039068","volume-title":"CONCUR 1990","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":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(90)90049-8","volume":"49","author":"R. Gurevi\u010d","year":"1990","unstructured":"Gurevi\u010d, 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":"14_CR11","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":"14_CR12","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"},{"issue":"1","key":"14_CR13","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"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1090\/S0002-9947-1951-0044470-3","volume":"71","author":"R.C. Lyndon","year":"1951","unstructured":"Lyndon, R.C.: 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":"14_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/S0218196796000040","volume":"6","author":"R.N. McKenzie","year":"1996","unstructured":"McKenzie, R.N.: Tarski\u2019s finite basis problem is undecidable. International Journal of Algebra and Computation\u00a06(1), 49\u2013104 (1996)","journal-title":"International Journal of Algebra and Computation"},{"key":"14_CR16","unstructured":"McKenzie, R.N., McNulty, G., Taylor, W.: Algebras, Varieties, Lattices. Wadsworth & Brooks\/Cole (1987)"},{"key":"14_CR17","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R. Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation\u00a081(2), 227\u2013247 (1989)","journal-title":"Information and Computation"},{"key":"14_CR19","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, University of Edinburgh (1989)"},{"key":"14_CR20","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":"14_CR21","first-page":"43","volume":"30","author":"V.L. Murski\u012d","year":"1975","unstructured":"Murski\u012d, V.L.: The existence of a finite basis of identities, and other properties of \u201calmost all\u201d finite algebras. Problemy Kibernetiki\u00a030, 43\u201356 (1975) (in Russian)","journal-title":"Problemy Kibernetiki"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica\u00a023(1), 9\u201366 (1986)","journal-title":"Acta Informatica"},{"key":"14_CR23","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)"},{"key":"14_CR24","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN- 19, Aarhus University (1981)"},{"key":"14_CR25","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, 313\u2013317 (1974)","journal-title":"Journal of Symbolic Logic"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BFb0015727","volume-title":"Automata, Languages and Programming","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A.: Linear and branching structures in the semantics and logics of reactive systems. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 15\u201332. Springer, Heidelberg (1985)"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/SFCS.1981.36","volume-title":"Proceedings 22nd IEEE Symposium on Foundations of Comper Science (FOCS 1981)","author":"W.C. Rounds","year":"1981","unstructured":"Rounds, W.C., Brookes, S.D.: Possible futures, acceptances, refusals, and communicating processes. In: Proceedings 22nd IEEE Symposium on Foundations of Comper Science (FOCS 1981), Nashville, pp. 140\u2013149. IEEE Computer Society Press, Los Alamitos (1981)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0055623","volume-title":"CONCUR \u201998 Concurrency Theory","author":"S. Veglioni","year":"1998","unstructured":"Veglioni, S., De Nicola, R.: Possible worlds for process algebras. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 179\u2013193. Springer, Heidelberg (1998)"}],"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-540-24727-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:53:58Z","timestamp":1552841638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}