{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:55:39Z","timestamp":1725602139089},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232824"},{"type":"electronic","value":"9783642232831"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23283-1_4","type":"book-chapter","created":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T02:30:27Z","timestamp":1314153027000},"page":"7-24","source":"Crossref","is-referenced-by-count":2,"title":["Axiomatizing Weak Ready Simulation Semantics over BCCSP"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"David","family":"de Frutos Escrig","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Gregorio-Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.W.: Turning SOS rules into equations. Information and Compututation\u00a0111(1), 1\u201352 (1994)","journal-title":"Information and Compututation"},{"issue":"9","key":"4_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ipl.2011.01.015","volume":"111","author":"L. Aceto","year":"2011","unstructured":"Aceto, L., de Frutos Escrig, D., Gregorio-Rodr\u00edguez, C., Ing\u00f3lfsd\u00f3ttir, A.: Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet. Information Processing Letters\u00a0111(9), 408\u2013413 (2011)","journal-title":"Information Processing Letters"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-73859-6_5","volume-title":"Algebra and Coalgebra in Computer Science","author":"L. Aceto","year":"2007","unstructured":"Aceto, L., Fokkink, W.J., Ing\u00f3lfsd\u00f3ttir, A.: Ready to preorder: Get your BCCSP axiomatization for free! In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 65\u201379. Springer, Heidelberg (2007)"},{"key":"4_CR4","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.J., Ing\u00f3lfsd\u00f3ttir, 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":"4_CR5","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W., Ingolfsdottir, A., Luttik, B.: A finite equational base for CCS with left merge and communication merge. ACM Trans. Comput. Log.\u00a010(1) (2009)","DOI":"10.1145\/1459010.1459016"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00236-010-0114-7","volume":"47","author":"L. Aceto","year":"2010","unstructured":"Aceto, L., Fokkink, W., Ing\u00f3lfsd\u00f3ttir, A., Mousavi, M.R.: Lifting non-finite axiomatizability results to extensions of process algebras. Acta Informatica\u00a047(3), 147\u2013177 (2010)","journal-title":"Acta Informatica"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L. Aceto","year":"1992","unstructured":"Aceto, L., Hennessy, M.: Termination, deadlock and divergence. Journal of the ACM\u00a039(1), 147\u2013187 (1992)","journal-title":"Journal of the ACM"},{"key":"4_CR8","series-title":"IFIP","first-page":"317","volume-title":"5th IFIP International Conference on Theoretical Computer Science","author":"L. Aceto","year":"2008","unstructured":"Aceto, L., Ingolfsdottir, A., Luttik, B., van Tilburg, P.: Finite equational bases for fragments of CCS with restriction and relabelling. In: 5th IFIP International Conference on Theoretical Computer Science. IFIP, vol.\u00a0273, pp. 317\u2013332. Springer, Heidelberg (2008)"},{"key":"4_CR9","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195003","volume-title":"Process Algebra: Equational Theories of Communicating Processes","author":"J. Baeten","year":"2009","unstructured":"Baeten, J., Basten, T., Reniers, M.: Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, vol.\u00a050. Cambridge University Press, Cambridge (2009)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jlap.2004.03.001","volume":"60-61","author":"J.C.M. Baeten","year":"2004","unstructured":"Baeten, J.C.M., de Vink, E.P.: Axiomatizing GSOS with termination. Journal of Logic and Algebraic Programming\u00a060-61, 323\u2013351 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"1-3","key":"4_CR11","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":"4_CR12","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. Journal of the ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"key":"4_CR13","unstructured":"Chen, T.: Clocks, Dice and Processes. PhD thesis, Centrum voor Wiskunde en Informatica (CWI), Vrije Universiteit, Amsterdam (2009)"},{"key":"4_CR14","first-page":"156","volume-title":"LICS","author":"T. Chen","year":"2008","unstructured":"Chen, T., Fokkink, W.: On the axiomatizability of impossible futures: Preorder versus equivalence. In: LICS, pp. 156\u2013165. IEEE Computer Society, Los Alamitos (2008)"},{"issue":"5","key":"4_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.ic.2007.09.003","volume":"206","author":"T. Chen","year":"2008","unstructured":"Chen, T., Fokkink, W., Luttik, B., Nain, S.: On finite alphabets and infinite bases. Information and Computation\u00a0206(5), 492\u2013519 (2008)","journal-title":"Information and Computation"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ipl.2008.09.003","volume":"109","author":"T. Chen","year":"2008","unstructured":"Chen, T., Fokkink, W., van Glabbeek, R.J.: Ready to preorder: The case of weak process semantics. Information Processing Letters\u00a0109(2), 104\u2013111 (2008)","journal-title":"Information Processing Letters"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.entcs.2009.07.093","volume":"249","author":"D. Frutos-Escrig de","year":"2009","unstructured":"de Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C., Palomino, M.: On the unification of process semantics: Equational semantics. Electronic Notes in Theoretical Computer Science\u00a0249, 243\u2013267 (2009)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"4_CR18","series-title":"IFIP","first-page":"397","volume-title":"5th IFIP International Conference on Theoretical Computer Science","author":"D. Frutos-Escrig de","year":"2008","unstructured":"de Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C.: Universal coinductive characterizations of process semantics. In: 5th IFIP International Conference on Theoretical Computer Science. IFIP, vol.\u00a0273, pp. 397\u2013412. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ic.2007.12.003","volume":"207","author":"D. Frutos-Escrig de","year":"2009","unstructured":"de Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C.: (Bi)simulations up-to characterise process semantics. Information and Computation\u00a0207(2), 146\u2013170 (2009)","journal-title":"Information and Computation"},{"issue":"7","key":"4_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.jlap.2008.09.001","volume":"78","author":"D. Frutos-Escrig de","year":"2009","unstructured":"de Frutos-Escrig, D., Gregorio-Rodr\u00edguez, C., Palomino, M.: Ready to preorder: an algebraic and general proof. Journal of Logic and Algebraic Programming\u00a078(7), 539\u2013551 (2009)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"4_CR23","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: Handbook of Process Algebra, vol.\u00a0ch. 1, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11601548_4","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"R.J. Glabbeek van","year":"2005","unstructured":"van Glabbeek, R.J.: A characterisation of weak bisimulation congruence. 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. 26\u201339. Springer, Heidelberg (2005)"},{"key":"4_CR26","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 omega-completeness applied to process algebra. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 314\u2013331. Springer, Heidelberg (1990)"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/S0019-9958(81)90082-6","volume":"51","author":"M. Hennessy","year":"1981","unstructured":"Hennessy, M.: A term model for synchronous processes. Informationa and Control\u00a051(1), 58\u201375 (1981)","journal-title":"Informationa and Control"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"4_CR29","volume-title":"Communicating Sequential Processes","author":"C. Hoare","year":"1985","unstructured":"Hoare, C.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation, 94(1):1\u201328 (1991)","DOI":"10.1016\/0890-5401(91)90030-6"},{"issue":"7","key":"4_CR31","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ic.2010.02.001","volume":"208","author":"G. L\u00fcttgen","year":"2010","unstructured":"L\u00fcttgen, G., Vogler, W.: Ready simulation for concurrency: It\u2019s logical! Information and Computation\u00a0208(7), 845\u2013867 (2010)","journal-title":"Information and Computation"},{"key":"#cr-split#-4_CR32.1","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Proceedings 2nd Joint Conference on Artificial Intelligence, pp. 481???489. BCS (1971);"},{"key":"#cr-split#-4_CR32.2","unstructured":"Also available as Report No. CS-205, Computer Science Department, Stanford University"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-10828-9_52","volume-title":"CAAP \u201981","author":"R. Milner","year":"1981","unstructured":"Milner, R.: A modal characterisation of observable machine behaviour. In: Astesiano, E., B\u00f6hm, C. (eds.) CAAP 1981. LNCS, vol.\u00a0112, pp. 25\u201334. Springer, Heidelberg (1981)"},{"key":"4_CR34","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"2","key":"4_CR35","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 behaviors. Information and Computation\u00a081(2), 227\u2013247 (1989)","journal-title":"Information and Computation"},{"key":"4_CR36","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, Report CST-59-89, Department of Computer Science, University of Edinburgh (1989)"},{"key":"4_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming\u00a060-61, 17\u2013139 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-60218-6_16","volume-title":"CONCUR \u201995 Concurrency Theory","author":"I. Ulidowski","year":"1995","unstructured":"Ulidowski, I.: Axiomatisations of weak equivalences for De Simone languages. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 219\u2013233. Springer, Heidelberg (1995)"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-45719-4_15","volume-title":"Algebraic Methodology and Software Technology","author":"I. Ulidowski","year":"2002","unstructured":"Ulidowski, I.: Refusal simulation and interactive games. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 208\u2013222. Springer, Heidelberg (2002)"},{"issue":"1","key":"4_CR40","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(01)00217-4","volume":"80","author":"M. Voorhoeve","year":"2001","unstructured":"Voorhoeve, M., Mauw, S.: Impossible futures and determinism. Information Processing Letters\u00a080(1), 51\u201358 (2001)","journal-title":"Information Processing Letters"},{"issue":"2","key":"4_CR41","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","volume":"85","author":"D. Walker","year":"1990","unstructured":"Walker, D.: Bisimulation and divergence. Information and Computation\u00a085(2), 202\u2013241 (1990)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23283-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T09:34:17Z","timestamp":1560504857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23283-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232824","9783642232831"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23283-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}