{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:50:53Z","timestamp":1648918253064},"reference-count":47,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5130,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0304-3975(98)00189-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"1-53","source":"Crossref","is-referenced-by-count":4,"title":["A specification structure for deadlock-freedom of synchronous processes"],"prefix":"10.1016","volume":"222","author":[{"given":"S.","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.J.","family":"Gay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00189-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of linear logic","volume":"111","author":"Abramsky","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB3","series-title":"Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing Workshop on Theory and Formal Methods, Workshops in Computer Science","first-page":"57","article-title":"Interaction categories (Extended Abstract)","author":"Abramsky","year":"1993"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB4","series-title":"A Classical Mind: Essays in Honour of C.A.R. Hoare","first-page":"1","article-title":"Interaction Categories and communicating sequential processes","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","article-title":"Proofs as processes","volume":"135","author":"Abramsky","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB6","series-title":"CONCUR'96: Proc. 7th Internat. Conf. on Concurrency Theory","article-title":"Retracing some paths in process algebra","volume":"vol. 1119","author":"Abramsky","year":"1996"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB7","series-title":"Deductive Program Design: Proc. 1994 Marktoberdorf Internat. Summer School, NATO ASI Series F: Computer and Systems Sciences","article-title":"Interaction categories and foundations of typed concurrent programming","author":"Abramsky","year":"1995"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB8","series-title":"Logics for Concurrency: Structure vs. Automata \u2014 Proc. VIIIth Banff Higher Order Workshop","article-title":"Specification structures and propositions-as-types for concurrency","volume":"vol. 1043","author":"Abramsky","year":"1996"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB9","series-title":"Theoretical Aspects of Computer Software, International Symposium TACS'97","first-page":"295","article-title":"A type-theoretic approach to deadlock-freedom of asynchronous systems","volume":"vol. 1281","author":"Abramsky","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(98)00189-3_BIB10","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","article-title":"Games and full completeness for multiplicative linear logic","volume":"59","author":"Abramsky","year":"1994","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.1016\/S0304-3975(98)00189-3_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1994.1041","article-title":"New foundations for the geometry of interaction","volume":"111","author":"Abramsky","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB12","series-title":"Theoretical Aspects of Computer Software. Internat. Symp. TACS'94","first-page":"1","article-title":"Full abstraction for PCF (extended abstract)","volume":"vol. 789","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB13","article-title":"Categories, Types and Structures: An Introduction to Category Theory for the Working computer scientist","author":"Asperti","year":"1991"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB14","article-title":"Process Algebra","volume":"vol. 18","author":"Baeten","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(98)00189-3_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0960129500001274","article-title":"\u2217-autonomous categories and linear logic","volume":"1","author":"Barr","year":"1991","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB16","series-title":"Algebraic Semantics","first-page":"35","article-title":"Theory and practice of sequential algorithms: the kernel of the applicative language CDS","author":"Berry","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(98)00189-3_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90053-V","article-title":"Linear logic, coherence and dinaturality","volume":"115","author":"Blute","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB18","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB19","volume":"vol. 6","author":"Cohn","year":"1981"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB20","series-title":"Categories for Types","author":"Crole","year":"1994"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB21","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB22","article-title":"Systolic Computations","volume":"vol. 83","author":"Frumkin","year":"1992"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB23","article-title":"Linear types for communicating processes","author":"Gay","year":"1995"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB24","series-title":"Proc. 10th Ann. IEEE Symp. on Logic in Computer Science","article-title":"A typed calculus of synchronous processes","author":"Gay","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(98)00189-3_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB26","first-page":"1321","article-title":"Programming real-time applications with SIGNAL","volume":"79","author":"Guernic","year":"1991"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB27","first-page":"1305","article-title":"The synchronous data flow programming language LUSTRE","volume":"79","author":"Halbwachs","year":"1991"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB28","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB29","first-page":"425","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB30","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0022-4049(80)90101-2","article-title":"Coherence for compact closed categories","volume":"19","author":"Kelly","year":"1980","journal-title":"J. Pure and Appl. Algebra"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB31","series-title":"Proc. 12th Ann. IEEE Symposium on Logic in Computer Science","article-title":"A partially deadlock-free typed process calculus","author":"Kobayashi","year":"1997"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB32","series-title":"Proc. 23rd ACM Symp. on Principles of Programming Languages","article-title":"Linearity and the pi-calculus","author":"Kobayashi","year":"1996"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB33","first-page":"789","article-title":"Logics of programs","volume":"vol. B","author":"Kozen","year":"1990"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB34","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB35","series-title":"Proc. Math. Foundation of Computer Science","article-title":"Deliverables: A categorical approach to program development in type theory","author":"McKinna","year":"1993"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB36","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(98)00189-3_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, I","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(98)00189-3_BIB38","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","article-title":"A calculus of mobile processes, II","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB39","article-title":"Typed concurrent programs: specification & verification","author":"Nagarajan","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(98)00189-3_BIB40","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1145\/210346.210425","article-title":"Parametricity and local variables","volume":"42","author":"O'Hearn","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB41","series-title":"Category Theory and Computer Science '97","first-page":"147","article-title":"Specifying interaction categories","volume":"vol. 1290","author":"Pavlovic","year":"1997"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB42","series-title":"Proc. 8th Ann. IEEE Symposium on Logic in Computer Science","article-title":"Types and subtypes for mobile processes","author":"Pierce","year":"1993"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB43","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1996.0052","article-title":"Relational properties of domains","volume":"127","author":"Pitts","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00189-3_BIB44","author":"Plotkin","year":"1981"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB45","series-title":"Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB46","series-title":"Proc. 6th European Conf. on Parallel Languages and Architectures","article-title":"An interaction-based language and its typing system","volume":"vol. 817","author":"Takeuchi","year":"1994"},{"key":"10.1016\/S0304-3975(98)00189-3_BIB47","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","article-title":"An extensional treatment of dataflow deadlock","volume":"13","author":"Wadge","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:21:29Z","timestamp":1555420889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0304397598001893"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00189-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}