乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T18:37:33Z","timestamp":1723487853194},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000782","name":"European Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000782","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002301","name":"Estonian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1016\/j.ic.2021.104767","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T16:27:38Z","timestamp":1621873658000},"page":"104767","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Bialgebraic foundations for the operational semantics of string diagrams"],"prefix":"10.1016","volume":"281","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Robin","family":"Piedeleu","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2021.104767_br0010","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ic.2021.104767_br0020","series-title":"A Calculus of Communicating Systems","author":"Milner","year":"1982"},{"key":"10.1016\/j.ic.2021.104767_br0030","series-title":"PI-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"10.1016\/j.ic.2021.104767_br0040","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","article-title":"Mobile ambients","volume":"240","author":"Cardelli","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104767_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.11.005","article-title":"The seal calculus","volume":"201","author":"Castagna","year":"2005","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2021.104767_br0060","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."},{"key":"10.1016\/j.ic.2021.104767_br0070","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"},{"key":"10.1016\/j.ic.2021.104767_br0080","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.ic.2021.104767_br0090","series-title":"Petri Nets: An Introduction, vol. 4","author":"Reisig","year":"2012"},{"key":"10.1016\/j.ic.2021.104767_br0100","series-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, vol. 1","author":"Jensen","year":"2013"},{"key":"10.1016\/j.ic.2021.104767_br0110","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","article-title":"Statecharts: a visual formalism for complex systems","volume":"8","author":"Harel","year":"1987","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.ic.2021.104767_br0120","first-page":"289","article-title":"A survey of graphical languages for monoidal categories","volume":"13","author":"Selinger","year":"2011","journal-title":"Springer Lect. Notes Phys."},{"key":"10.1016\/j.ic.2021.104767_br0130","series-title":"LICS 2004","first-page":"415","article-title":"A categorical semantics of quantum protocols","author":"Abramsky","year":"2004"},{"key":"10.1016\/j.ic.2021.104767_br0140","series-title":"ICALP","first-page":"298","article-title":"Interacting quantum observables","author":"Coecke","year":"2008"},{"key":"10.1016\/j.ic.2021.104767_br0150","series-title":"POPL","first-page":"515","article-title":"Full abstraction for signal flow graphs","author":"Bonchi","year":"2015"},{"key":"10.1016\/j.ic.2021.104767_br0160","first-page":"836","article-title":"Categories in control","volume":"30","author":"Baez","year":"2015","journal-title":"Theory Appl. Categ."},{"key":"10.1016\/j.ic.2021.104767_br0170","series-title":"LICS","first-page":"1","article-title":"A categorical approach to open and interconnected dynamical systems","author":"Fong","year":"2016"},{"key":"10.1016\/j.ic.2021.104767_br0180","series-title":"POPL","article-title":"Diagrammatic algebra: from linear to concurrent systems","author":"Bonchi","year":"2019"},{"key":"10.1016\/j.ic.2021.104767_br0190","first-page":"5","article-title":"A compositional framework for passive linear circuits","volume":"54","author":"Baez","year":"2015","journal-title":"J. Complex Netw."},{"key":"10.1016\/j.ic.2021.104767_br0200","series-title":"Abramsky Festschrift","first-page":"52","article-title":"Diagrammatic reasoning for delay-insensitive asynchronous circuits","author":"Ghica","year":"2013"},{"key":"10.1016\/j.ic.2021.104767_br0210","series-title":"LICS 1997","first-page":"280","article-title":"Towards a mathematical operational semantics","author":"Turi","year":"1997"},{"key":"10.1016\/j.ic.2021.104767_br0220","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."},{"key":"10.1016\/j.ic.2021.104767_br0230","series-title":"AMAST 1997","article-title":"Span(Graph): an algebra of transition systems","volume":"vol. 1349","author":"Katis","year":"1997"},{"key":"10.1016\/j.ic.2021.104767_br0240","series-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","first-page":"133","article-title":"The tile model","author":"Gadducci","year":"2000"},{"key":"10.1016\/j.ic.2021.104767_br0250","series-title":"ICE","first-page":"87","article-title":"A non-interleaving process calculus for multi-party synchronisation","author":"Soboci\u0144ski","year":"2009"},{"key":"10.1016\/j.ic.2021.104767_br0260","series-title":"CONCUR","first-page":"37:1","article-title":"Bialgebraic semantics for string diagrams","volume":"vol. 140","author":"Bonchi","year":"2019"},{"key":"10.1016\/j.ic.2021.104767_br0270","series-title":"CONCUR","first-page":"435","article-title":"A categorical semantics of signal flow graphs","author":"Bonchi","year":"2014"},{"key":"10.1016\/j.ic.2021.104767_br0280","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.ic.2016.03.002","article-title":"The calculus of signal flow diagrams I: linear relations on streams","volume":"252","author":"Bonchi","year":"2017","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ic.2021.104767_br0290","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1090\/S0002-9904-1965-11234-4","article-title":"Categorical algebra","volume":"71","author":"Mac Lane","year":"1965","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.ic.2021.104767_br0300","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/j.ic.2021.104767_br0310","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."},{"key":"10.1016\/j.ic.2021.104767_br0320","series-title":"Computation, Meaning, and Logic","first-page":"437","article-title":"Lawvere theories and monads","author":"Hyland","year":"2007"},{"key":"10.1016\/j.ic.2021.104767_br0330","series-title":"CONCUR","first-page":"449","article-title":"A first order coalgebraic model of pi-calculus early observational equivalence","author":"Buscemi","year":"2002"},{"key":"10.1016\/j.ic.2021.104767_br0340","series-title":"CALCO","article-title":"Presenting distributive laws","author":"Bonsangue","year":"2013"},{"key":"10.1016\/j.ic.2021.104767_br0350","series-title":"Enhanced Coinduction","author":"Rot","year":"2015"},{"key":"10.1016\/j.ic.2021.104767_br0360","author":"Fong"},{"key":"10.1016\/j.ic.2021.104767_br0370","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/S1571-0661(05)80267-1","article-title":"Terminal sequences for accessible endofunctors","volume":"19","author":"Worrell","year":"1999","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104767_br0380","author":"Bonchi"},{"key":"10.1016\/j.ic.2021.104767_br0390","series-title":"QI","first-page":"143","article-title":"Quantum and classical structures in nondeterministic computation","author":"Pavlovic","year":"2009"},{"key":"10.1016\/j.ic.2021.104767_br0400","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.jlamp.2017.12.002","article-title":"Deconstructing Lawvere with distributive laws","volume":"95","author":"Bonchi","year":"2018","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.ic.2021.104767_br0410","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104767_br0420","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/23005.24038","article-title":"A model for distributed systems based on graph rewriting","volume":"34","author":"Degano","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2021.104767_br0430","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.entcs.2005.03.032","article-title":"Hoare vs Milner: comparing synchronizations in a graphical framework with mobility","volume":"154","author":"Lanese","year":"2006","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104767_br0440","series-title":"LICS","first-page":"1","article-title":"Rewriting modulo symmetric monoidal structure","author":"Bonchi","year":"2016"},{"key":"10.1016\/j.ic.2021.104767_br0450","series-title":"LICS","first-page":"1","article-title":"Graphical affine algebra","author":"Bonchi","year":"2019"},{"key":"10.1016\/j.ic.2021.104767_br0460","series-title":"8th Conference on Algebra and Coalgebra in Computer Science","first-page":"1","article-title":"Nominal string diagrams","author":"Balco","year":"2019"},{"key":"10.1016\/j.ic.2021.104767_br0470","series-title":"Proceedings 14th International Conference on Quantum Physics and Logic","first-page":"71","article-title":"A structural and nominal syntax for diagrams","volume":"vol. 266","author":"Ghica","year":"2017"},{"key":"10.1016\/j.ic.2021.104767_br0480","series-title":"The Space and Motion of Communicating Agents","author":"Milner","year":"2009"},{"key":"10.1016\/j.ic.2021.104767_br0490","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-2014-1103","article-title":"On hierarchical graphs: reconciling bigraphs, gs-monoidal theories and gs-graphs","volume":"134","author":"Bruni","year":"2014","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.ic.2021.104767_br0500","series-title":"FSTTCS","first-page":"272","article-title":"Generalizing the powerset construction, coalgebraically","author":"Silva","year":"2010"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540121000821?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540121000821?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T08:56:18Z","timestamp":1678006578000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540121000821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":50,"alternative-id":["S0890540121000821"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2021.104767","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bialgebraic foundations for the operational semantics of string diagrams","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2021.104767","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104767"}}