{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:42Z","timestamp":1725551682423},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_18","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:39:45Z","timestamp":1134175185000},"page":"338-367","source":"Crossref","is-referenced-by-count":21,"title":["Finite Equational Bases in Process Algebra: Results and Open Questions"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0304-3975(02)00236-0","volume":"293","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., \u00c9sik, Z., Ingolfsdottir, A.: The max-plus algebra of the natural numbers has no finite equational basis. Theoretical Computer Science\u00a0293(1), 169\u2013188 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_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., Ingolfsdottir, A.: A menagerie of non-finitely based process semantics over\u00a0BPA*\u2014from ready simulation to completed traces. Mathematical Structures in Computer Science\u00a08(3), 193\u2013230 (1998)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2004.10.003","volume":"330","author":"L. Aceto","year":"2005","unstructured":"Aceto, L., Fokkink, W.J., Ingolfsdottir, A., Luttik, S.P.: CCS with Hennessy\u2019s merge has no finite equational axiomatization. Theoretical Computer Science\u00a0330(3), 377\u2013405 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR4","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.J., van Glabbeek, R.J., Ingolfsdottir, A.: Nested semantics over finite trees are equationally hard. Information and Computation\u00a0191(2), 203\u2013232 (2004)","journal-title":"Information and Computation"},{"issue":"2\u20133","key":"18_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"J.C.M. Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theoretical Computer Science\u00a0335(2\u20133), 131\u2013146 (2005)","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(94)90057-4","volume":"124","author":"J.A. Bergstra","year":"1994","unstructured":"Bergstra, J.A., Heering, J.: Which data types have omega-complete initial algebra specifications? Theoretical Computer Science\u00a0124(1), 149\u2013168 (1994)","journal-title":"Theoretical Computer Science"},{"key":"18_CR8","unstructured":"Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebras. Report IW 206, Mathematisch Centrum, Amsterdam (1982)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-13345-3_7","volume-title":"Automata, Languages, and Programming","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 82\u201395. Springer, Heidelberg (1984)"},{"issue":"1\/3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1\/3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","series-title":"CWI Monograph","first-page":"89","volume-title":"Mathematics and Computer Science","author":"J.A. Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Mathematics and Computer Science. CWI Monograph, vol.\u00a01, pp. 89\u2013138. North-Holland, Amsterdam (1986)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: On the structure of abstract algebras. In: Proceedings Cambridge Philosophical Society, vol.\u00a031, pp. 433\u2013454 (1935)","DOI":"10.1017\/S0305004100013463"},{"key":"18_CR14","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.C.C. Blom","year":"2003","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, pp. 109\u2013118. Springer, Heidelberg (2003)"},{"key":"18_CR15","volume-title":"Graduate Texts in Mathematics","author":"S.N. Burris","year":"1981","unstructured":"Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra. In: Graduate Texts in Mathematics. Springer, Heidelberg (1981), The Millennium Edition of this book is available at, \n \n http:\/\/www.math.uwaterloo.ca\/~snburris\/htdocs\/ualg.html"},{"key":"18_CR16","volume-title":"Mathematics Series","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. In: Brown, R., De Wet, J. (eds.) Mathematics Series. Chapman and Hall, Boca Raton (1971)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-46691-6_25","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"Z. \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z., Okawa, S.: Series and parallel operations on pomsets. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 316\u2013328. Springer, Heidelberg (1999)"},{"key":"18_CR18","series-title":"An EATCS Series","volume-title":"Texts in Theoretical Computer Science","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J.: Introduction to Process Algebra. In: Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (January 2000)"},{"key":"18_CR19","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 omega-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":"18_CR20","series-title":"Lecture Notes in Computer Science","first-page":"182","volume-title":"Virtual Storytelling. Using Virtual RealityTechnologies for Storytelling","author":"W.J. Fokkink","year":"2003","unstructured":"Fokkink, W.J., Nain, S.: On finite alphabets and infinite bases: From ready pairs to possible worlds. In: Balet, O., Subsol, G., Torguet, P. (eds.) ICVS 2003. LNCS, vol.\u00a02897, pp. 182\u2013194. Springer, Heidelberg (2003)"},{"key":"18_CR21","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":"18_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoretical Computer Science\u00a061, 199\u2013224 (1988)","journal-title":"Theoretical Computer Science"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"18_CR24","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-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. North-Holland, Amsterdam (2001)"},{"key":"18_CR25","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)"},{"issue":"2-3","key":"18_CR26","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(2-3), 149\u2013167 (1986)","journal-title":"Theoretical Computer Science"},{"key":"18_CR27","volume-title":"Algebraic Theory of Processes","author":"M.C.B. Hennessy","year":"1988","unstructured":"Hennessy, M.C.B.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"issue":"5","key":"18_CR28","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/0217063","volume":"17","author":"M.C.B. Hennessy","year":"1988","unstructured":"Hennessy, M.C.B.: Axiomatising finite concurrent processes. SIAM Journal on Computing\u00a017(5), 997\u20131017 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"18_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M.C.B. Hennessy","year":"1985","unstructured":"Hennessy, M.C.B., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-48523-6_38","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Jerrum, M.: Bisimulation equivalence is decidable for normed process algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 412\u2013421. Springer, Heidelberg (1999)"},{"key":"18_CR31","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"issue":"7","key":"18_CR32","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Communications of the ACM\u00a019(7), 371\u2013384 (1976)","journal-title":"Communications of the ACM"},{"key":"18_CR33","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/3-540-55210-3_223","volume-title":"STACS 92","author":"H. Lin","year":"1992","unstructured":"Lin, H.: An interactive proof tool for process algebras. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 617\u2013618. Springer, Heidelberg (1992)"},{"issue":"3","key":"18_CR35","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences\u00a028(3), 439\u2013466 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR36","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"18_CR37","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, Department of Computer Science, University of Edinburgh, Report CST-59-89. Also published as ECS-LFCS-89-84 (July 1989)"},{"key":"18_CR38","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":"18_CR39","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/LICS.1990.113741","volume-title":"Proceedings 5th Symposium on Logic in Computer Science","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The nonexistence of finite axiomatisations for CCS congruences. In: Proceedings 5th Symposium on Logic in Computer Science, Philadelphia, pp. 142\u2013153. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"18_CR40","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":"18_CR41","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)"},{"key":"18_CR42","first-page":"17","volume":"60\u201361","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming\u00a060\u201361, 17\u2013139 (2004); This is a revised version of the original DAIMI memo [41]","journal-title":"Journal of Logic and Algebraic Programming"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T07:57:31Z","timestamp":1552463851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/11601548_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}