乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T11:15:20Z","timestamp":1700306120621},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0168-0072(02)00082-9","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T21:13:35Z","timestamp":1048626815000},"page":"39-87","source":"Crossref","is-referenced-by-count":5,"title":["On the expressiveness of choice quantification"],"prefix":"10.1016","volume":"121","author":[{"given":"Bas","family":"Luttik","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0168-0072(02)00082-9_BIB1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","article-title":"Real time process algebra","volume":"3","author":"Baeten","year":"1991","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"10.1016\/S0168-0072(02)00082-9_BIB2","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01215407","article-title":"On sequential composition, action prefixes and process prefix","volume":"6","author":"Baeten","year":"1994","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB3","article-title":"Process algebra","volume":"No. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB4","article-title":"The lambda calculus\u2014its syntax and semantics","volume":"vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB5","series-title":"Proc. 11th Internat. Colloq. on Automata Languages and Programming (ICALP 1984)","first-page":"82","article-title":"The algebra of recursively defined processes and the algebra of regular processes","volume":"vol. 172","author":"Bergstra","year":"1984"},{"issue":"1\u20133","key":"10.1016\/S0168-0072(02)00082-9_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0168-0072(02)00082-9_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"An introduction to the ISO specification language LOTOS","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Comput. Networks ISDN System"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB8","article-title":"A Course in Universal Algebra","volume":"No. 78","author":"Burris","year":"1981"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB9","unstructured":"C.C. Chang, H.J. Keisler, Model Theory, Studies in Logic and the Foundations of Mathematics, 3rd Edition, vol. 73, North-Holland, Amsterdam\/New York\/Oxford\/Tokyo, 1990."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB10","series-title":"Computability and Unsolvability","author":"Davis","year":"1982"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB11","series-title":"Algebra of Communicating Processes, Workshops in Computing","first-page":"26","article-title":"The syntax and semantics of \u03bcCRL","author":"Groote","year":"1995"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB12","series-title":"Handbook of Process Algebra","first-page":"1151","article-title":"Algebraic process verification","author":"Groote","year":"2001"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB13","unstructured":"J.F. Groote, M.A. Reniers, J.J. van Wamel, M.B. van der Zwaag, Completeness of timed \u03bcCRL. Report SEN-R0034, CWI, 2000, available from http:\/\/www.cwi.nl\/."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB14","doi-asserted-by":"crossref","unstructured":"P.R. Halmos, Naive Set Theory, Undergraduate Texts in Mathematics, 2nd Edition, Springer, New York, 1974 (1st Edition, published by D. Van Nostrand Co., Princeton, NJ, Toronto\/London\/New York, 1960).","DOI":"10.1007\/978-1-4757-1645-0"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/BF01642508","article-title":"A proof system for communicating processes with value-passing","volume":"3","author":"Hennessy","year":"1991","journal-title":"Formal Aspects Comput."},{"issue":"2","key":"10.1016\/S0168-0072(02)00082-9_BIB16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","article-title":"Symbolic bisimulations","volume":"138","author":"Hennessy","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB17","series-title":"Handbook of Process Algebra","first-page":"427","article-title":"A symbolic approach to value-passing processes","author":"Ing\u00f3lfsd\u00f3ttir","year":"2001"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB18","unstructured":"B. Luttik, Choice quantification in process algebra, Ph.D. Thesis, University of Amsterdam, 2002."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB19","first-page":"85","article-title":"A process specification formalism","volume":"XIII","author":"Mauw","year":"1990","journal-title":"Fund. Inform."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB20","unstructured":"R.N. McKenzie, G.F. McNulty, W.F. Taylor, Algebras, Lattices, Varieties\u2014vol. I, Wadsworth & Brooks\/Cole, Monterey, CA, 1987."},{"issue":"3","key":"10.1016\/S0168-0072(02)00082-9_BIB21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"28","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB22","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB23","series-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"Milner","year":"1999"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/malq.19550010205","article-title":"Creative sets","volume":"1","author":"Myhill","year":"1955","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB25","doi-asserted-by":"crossref","unstructured":"J. Parrow, B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, in: Proc. LICS\u201998, IEEE Computer Society Press, Silver Spring, MD, 1998, pp. 176\u2013185.","DOI":"10.1109\/LICS.1998.705654"},{"issue":"6","key":"10.1016\/S0168-0072(02)00082-9_BIB26","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/BF01213493","article-title":"Computable processes and bisimulation equivalence","volume":"8","author":"Ponse","year":"1996","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB27","series-title":"The Mathematics of Metamathematics","author":"Rasiowa","year":"1963"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB28","unstructured":"H. Rogers Jr., Theory of Recursive Functions and Effective Computability, The MIT Press, Cambridge, MA, Paperback edition, 1992, Original edition published by McGraw-Hill Book Company, New York, 1967."},{"issue":"5\u20136","key":"10.1016\/S0168-0072(02)00082-9_BIB29","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s001650050030","article-title":"The tree identify protocol of IEEE 1394 in \u03bcCRL","volume":"10","author":"Shankland","year":"1998","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0168-0072(02)00082-9_BIB30","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/S0168-0072(02)00082-9_BIB31","unstructured":"A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 42 (1936) 230\u2013265, corrections in Proc. London Math. Soc. 43 (1936) 544\u2013546."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007202000829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:22:45Z","timestamp":1554776565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007202000829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0168007202000829"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(02)00082-9","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}