乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:12:16Z","timestamp":1740118336934,"version":"3.37.3"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["320571"],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"LABEX MILYON","award":["ANR-10-LABX-0070","ANR-11-IDEX-0007"]},{"name":"PACE","award":["ANR-12IS02001"]},{"name":"REPAS","award":["ANR-16-CE25-0011"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1016\/j.scico.2018.10.007","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T22:37:04Z","timestamp":1542062224000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Bisimilarity of open terms in stream GSOS"],"prefix":"10.1016","volume":"172","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Tom","family":"van Bussel","sequence":"additional","affiliation":[]},{"given":"Matias David","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.scico.2018.10.007_br0010","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","article-title":"Higher-level synchronising devices in Meije-SCCS","volume":"37","author":"de Simone","year":"1985","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.scico.2018.10.007_br0020","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1006\/inco.1999.2818","article-title":"Bisimilarity of open terms","volume":"156","author":"Rensink","year":"2000","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.scico.2018.10.007_br0030","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.tcs.2007.09.004","article-title":"A semantic framework for open processes","volume":"389","author":"Baldan","year":"2007","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.scico.2018.10.007_br0040","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1017\/S0960129511000417","article-title":"Proving the validity of equations in GSOS languages using rule-matching bisimilarity","volume":"22","author":"Aceto","year":"2012","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0050","series-title":"Proc. CALCO 2009","first-page":"433","article-title":"CIRC: a behavioral verification tool based on circular coinduction","author":"Lucanu","year":"2009"},{"key":"10.1016\/j.scico.2018.10.007_br0060","series-title":"Proc. FOSSACS","first-page":"109","article-title":"Incremental pattern-based coinduction for process algebra and its Isabelle formalization","author":"Popescu","year":"2010"},{"key":"10.1016\/j.scico.2018.10.007_br0070","series-title":"Proceedings of RTA 2011","first-page":"393","article-title":"Proving equality of streams automatically","author":"Zantema","year":"2011"},{"issue":"38","key":"10.1016\/j.scico.2018.10.007_br0080","doi-asserted-by":"crossref","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","article-title":"Bialgebras for structural operational semantics: an introduction","volume":"412","author":"Klin","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.scico.2018.10.007_br0090","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.scico.2018.10.007_br0100","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.tcs.2005.06.019","article-title":"A tutorial on coinductive stream calculus and signal flow graphs","volume":"343","author":"Rutten","year":"2005","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.scico.2018.10.007_br0110","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S096012951000054X","article-title":"Pointwise extensions of GSOS-defined operations","volume":"21","author":"Hansen","year":"2011","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0120","series-title":"Advanced Topics in Bisimulation and Coinduction","first-page":"233","article-title":"Enhancements of the bisimulation proof method","author":"Pous","year":"2011"},{"author":"Hansen","key":"10.1016\/j.scico.2018.10.007_br0130"},{"key":"10.1016\/j.scico.2018.10.007_br0140","series-title":"Fundamentals of Software Engineering - 7th International Conference","first-page":"35","article-title":"Bisimilarity of open terms in stream GSOS","volume":"vol. 10522","author":"Bonchi","year":"2017"},{"key":"10.1016\/j.scico.2018.10.007_br0150","series-title":"Proc. FOSSACS","first-page":"106","article-title":"Companions, codensity and causality","author":"Pous","year":"2017"},{"key":"10.1016\/j.scico.2018.10.007_br0160","series-title":"7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017","article-title":"Monoidal company for accessible functors","author":"Basold","year":"2017"},{"key":"10.1016\/j.scico.2018.10.007_br0170","series-title":"Proceedings LICS 1997","first-page":"280","article-title":"Towards a mathematical operational semantics","author":"Turi","year":"1997"},{"key":"10.1016\/j.scico.2018.10.007_br0180","first-page":"97","article-title":"Symbolic synthesis of mealy machines from arithmetic bitstream functions","volume":"20","author":"Hansen","year":"2010","journal-title":"Sci. Ann. Comput. Sci."},{"issue":"3","key":"10.1016\/j.scico.2018.10.007_br0190","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","article-title":"SOS formats and meta-theory: 20 years after","volume":"373","author":"Mousavi","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0200","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/S1571-0661(04)80972-1","article-title":"Elements of stream calculus (an extensive exercise in coinduction)","volume":"45","author":"Rutten","year":"2001","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.scico.2018.10.007_br0210","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"year":"2004","series-title":"On Generalised Coinduction and Probabilistic Specification Formats","author":"Bartels","key":"10.1016\/j.scico.2018.10.007_br0220"},{"issue":"2","key":"10.1016\/j.scico.2018.10.007_br0230","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00236-016-0271-4","article-title":"A general account of coinduction up-to","volume":"54","author":"Bonchi","year":"2017","journal-title":"Acta Inform."},{"key":"10.1016\/j.scico.2018.10.007_br0240","series-title":"6th Conference on Algebra and Coalgebra in Computer Science, CALCO","first-page":"190","article-title":"Presenting morphisms of distributive laws","author":"Klin","year":"2015"},{"key":"10.1016\/j.scico.2018.10.007_br0250","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S1571-0661(05)80350-0","article-title":"Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads","volume":"33","author":"Lenisa","year":"2000","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.scico.2018.10.007_br0260","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(01)00024-X","article-title":"Combining a monad and a comonad","volume":"280","author":"Power","year":"2002","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.scico.2018.10.007_br0270","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S1571-0661(04)80372-4","article-title":"Well-behaved translations between structural operational semantics","volume":"65","author":"Watanabe","year":"2002","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0280","series-title":"Interactive Theorem Proving \u2013 4th International Conference","first-page":"354","article-title":"Circular coinduction in Coq using bisimulation-up-to techniques","volume":"vol. 7998","author":"Endrullis","year":"2013"},{"year":"2010","series-title":"Kleene Coalgebra","author":"Silva","key":"10.1016\/j.scico.2018.10.007_br0290"},{"issue":"3","key":"10.1016\/j.scico.2018.10.007_br0300","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0310","series-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","first-page":"338","article-title":"Finite equational bases in process algebra: results and open questions","author":"Aceto","year":"2005"},{"issue":"2","key":"10.1016\/j.scico.2018.10.007_br0320","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.scico.2018.10.007_br0330","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","article-title":"Transition system specifications with negative premises","volume":"118","author":"Groote","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2018.10.007_br0340","series-title":"Algebra, Meaning, and Computation","first-page":"375","article-title":"A bialgebraic review of deterministic automata, regular expressions and languages","author":"Jacobs","year":"2006"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642318300406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642318300406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T01:09:20Z","timestamp":1712365760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642318300406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":34,"alternative-id":["S0167642318300406"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2018.10.007","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bisimilarity of open terms in stream GSOS","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2018.10.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}