{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:20Z","timestamp":1725491600897},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_14","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"197-211","source":"Crossref","is-referenced-by-count":0,"title":["Is Observational Congruence Axiomatisable in Equational Horn Logic?"],"prefix":"10.1007","author":[{"given":"Michael","family":"Mendler","sequence":"first","affiliation":[]},{"given":"Gerald","family":"L\u00fcttgen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11787006_41","volume-title":"Automata, Languages and Programming","author":"L. Aceto","year":"2006","unstructured":"Aceto, L., Chen, T., Fokkink, W., Ingolfsdottir, A.: On the axiomatizability of priority. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 480\u2013491. Springer, Heidelberg (2006)"},{"key":"14_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)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(94)00285-9","volume":"152","author":"L. Aceto","year":"1995","unstructured":"Aceto, L., Jeffrey, A.: A complete axiomatization of timed bisimulation for a class of timed regular behaviours. TCS\u00a0152(2), 251\u2013268 (1995)","journal-title":"TCS"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-57880-3_4","volume-title":"Programming Languages and Systems - ESOP \u201994","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R., Mendler, M.: An asynchronous process algebra with multiple clocks. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol.\u00a0788, pp. 58\u201373. Springer, Heidelberg (1994)"},{"key":"14_CR5","volume-title":"Process Algebra with Timing","author":"J.C.M. Baeten","year":"1998","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. Springer, Heidelberg (1998)"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0129054192000164","volume":"3","author":"S.L. Bloom","year":"1992","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration algebras. Foundations of Computer Science\u00a03(3), 245\u2013302 (1992)","journal-title":"Foundations of Computer Science"},{"key":"14_CR7","volume-title":"EATCS Monographs in TCS","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. In: EATCS Monographs in TCS, Springer, Heidelberg (1993)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/10719839_36","volume-title":"LATIN 2000: Theoretical Informatics","author":"S.L. Bloom","year":"2000","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration algebras are not finitely axiomatizable. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 367\u2013376. Springer, Heidelberg (2000)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/11817949_28","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"T. Chen","year":"2006","unstructured":"Chen, T., Fokkink, W.: On finite alphabets and infinite bases III: Simulation. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 421\u2013434. Springer, Heidelberg (2006)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-63141-0_12","volume-title":"CONCUR\u201997: Concurrency Theory","author":"R. Cleaveland","year":"1997","unstructured":"Cleaveland, R., L\u00fcttgen, G., Mendler, M.: An algebraic theory of multiple clocks. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 166\u2013180. Springer, Heidelberg (1997)"},{"key":"14_CR11","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Australia (1971)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-46011-X_3","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z.: The equational theory of fixed points with applications to generalized language theory. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 21\u201336. Springer, Heidelberg (2002)"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","volume":"52","author":"W. Fokkink","year":"1994","unstructured":"Fokkink, W.: A complete equational axiomatization for prefix iteration. Information Processing Letters\u00a052(6), 333\u2013337 (1994)","journal-title":"Information Processing Letters"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"W. Fokkink","year":"1994","unstructured":"Fokkink, W., Zantema, H.: Basic process algebra with iteration: Completeness of its equational axioms. The Computer J.\u00a037(4), 259\u2013267 (1994)","journal-title":"The Computer J."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.: The linear time\u2013branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"14_CR16","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. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.: A complete axiomatization for branching bisimulation congruence of finite state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 473\u2013484. Springer, Heidelberg (1993)"},{"key":"14_CR17","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":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inform. & Comp.\u00a0110(2), 366\u2013390 (1994)","journal-title":"Inform. & Comp."},{"key":"14_CR19","unstructured":"Mendler, M., L\u00fcttgen, G.: Is observational congruence on \u03bc-expressions axiomatisable in equational Horn logic? Bamberger Beitr\u00e4ge zur Wirtschaftsinformatik und Angewandten Informatik, Techn. Rep. No. 72, Univ. of Bamberg (June 2007)"},{"issue":"3","key":"14_CR20","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. J. of Computer and System Sciences\u00a028(3), 439\u2013466 (1984)","journal-title":"J. of Computer and System Sciences"},{"key":"14_CR21","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_CR22","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. Inform. & Comp.\u00a081(2), 227\u2013247 (1989)","journal-title":"Inform. & Comp."},{"key":"14_CR23","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, LFCS, Univ. of Edinburgh (1989), Also published as ECS-LFCS-89-84"},{"key":"14_CR24","first-page":"142","volume-title":"LICS 1990","author":"F. Moller","year":"1990","unstructured":"Moller, F.: The nonexistence of finite axiomatisations for CCS congruences. In: LICS 1990, pp. 142\u2013153. IEEE Computer Society Press, Los Alamitos (1990)"},{"issue":"4","key":"14_CR25","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/96559.96570","volume":"37","author":"G. Nadathur","year":"1990","unstructured":"Nadathur, G., Miller, D.: Higher-order Horn clauses. JACM\u00a037(4), 777\u2013814 (1990)","journal-title":"JACM"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0168-0072(97)00036-5","volume":"90","author":"P. Sewell","year":"1997","unstructured":"Sewell, P.: Nonaxiomatisability of equivalences over finite state processes. Annals of Pure and Applied Logic\u00a090, 163\u2013191 (1997)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:59Z","timestamp":1619519099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}