{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T22:49:06Z","timestamp":1784846946860,"version":"3.55.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470566","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":14,"title":["Categories of Nets"],"prefix":"10.1109","author":[{"given":"John C.","family":"Baez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Genovese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jade","family":"Master","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Shulman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0040-9383(99)00031-2"},{"key":"ref31","year":"0","journal-title":"The mathematical specification of the Statebox language"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)80709-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2015.09.003"},{"key":"ref11","article-title":"Computational Petri nets: adjunctions considered harmful","author":"genovese","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.287.7"},{"key":"ref13","author":"girault","year":"2013","journal-title":"Petri Nets for Systems Engineering A Guide to Modeling Verification and Applications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(91)90003-P"},{"key":"ref16","first-page":"609","article-title":"Polynomial functors and trees","volume":"3","author":"kock","year":"2011","journal-title":"International Mathematics Research Notices"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s13348-015-0160-0"},{"key":"ref18","article-title":"Elements of Petri nets and processes","author":"kock","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10485-008-9167-y"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.7146\/brics.v1i33.21610"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80302-0"},{"key":"ref27","author":"peterson","year":"1981","journal-title":"Petri Net Theory and the Modeling of Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2012.04.011"},{"key":"ref6","article-title":"A direct proof that the category of 3-computads is not cartesian closed","author":"cheng","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59293-8_205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3050"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/SWAT.1973.11","author":"ehrig","year":"1973","journal-title":"Switching and Automata Theory"},{"key":"ref7","first-page":"175","author":"degano","year":"1989","journal-title":"Logic in Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40020-2_8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/1184"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129520000043"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.exmath.2019.02.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/11841883_14"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129520000262"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2008.04.010"},{"key":"ref26","article-title":"Groupoids and local cartesian closure","volume":"21","author":"palmgren","year":"2003","journal-title":"University of Trier Department of Mathematics Tech Rep"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90013-8"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Rome, Italy","start":{"date-parts":[[2021,6,29]]},"end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470566.pdf?arnumber=9470566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:21Z","timestamp":1652197581000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470566","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}