{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:53Z","timestamp":1725544073018},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11690634_1","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:15:28Z","timestamp":1143555328000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation"],"prefix":"10.1007","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]},{"given":"Sumit","family":"Nain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_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.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"},{"key":"1_CR2","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":"1_CR3","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":"1_CR4","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.J. Fokkink","year":"2004","unstructured":"Fokkink, W.J., 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":"1_CR5","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":"1_CR6","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":"1_CR7","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":"3","key":"1_CR8","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"},{"key":"1_CR9","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"1_CR10","unstructured":"Moller, F.: Axioms for Concurrency. PhD thesis, University of Edinburgh (1989)"}],"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\/11690634_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T05:14:25Z","timestamp":1552367665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11690634_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}