{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:27:16Z","timestamp":1742390836936},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"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":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90035-g","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"203-223","source":"Crossref","is-referenced-by-count":24,"title":["A2CCS: atomic actions for CCS"],"prefix":"10.1016","volume":"72","author":[{"given":"Roberto","family":"Gorrieri","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Marchetti","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90035-G_BIB1","first-page":"51","article-title":"Now you may compose temporal logic specifications","author":"Barringer","year":"1984","journal-title":"Proc. 16th ACM Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(90)90035-G_BIB2","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"},{"key":"10.1016\/0304-3975(90)90035-G_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","article-title":"Concurrency control in distributed database systems","volume":"13","author":"Bernstein","year":"1981","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0304-3975(90)90035-G_BIB4","article-title":"Communication is an abstraction","author":"Boudol","year":"1987","journal-title":"INRIA Rapport de Recherche No. 636"},{"key":"10.1016\/0304-3975(90)90035-G_BIB5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","article-title":"Concurrency and atomicity","volume":"59","author":"Boudol","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90035-G_BIB6","first-page":"12","article-title":"Concurrency vs. interleaving: an instructive example","volume":"31","author":"Castellano","year":"1987","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90035-G_BIB7","first-page":"515","article-title":"Questions to Robin Milner\u2014A responder's commentary","author":"De Roever","year":"1986","journal-title":"Proc. IFIP Congress '86"},{"key":"10.1016\/0304-3975(90)90035-G_BIB8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying concurrent program modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0304-3975(90)90035-G_BIB9","first-page":"657","article-title":"What good is temporal logic?","author":"Lamport","year":"1983","journal-title":"Proc. IFIP Congress '83"},{"key":"10.1016\/0304-3975(90)90035-G_BIB10","series-title":"Proc. Internat. Conf. on Data Base Theory '86","first-page":"278","article-title":"Introduction to the theory of nested transactions","volume":"243","author":"Lynch","year":"1986"},{"key":"10.1016\/0304-3975(90)90035-G_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/41840.41852","article-title":"Hierarchical correctness proofs for distributed algorithms","author":"Lynch","year":"1987","journal-title":"Proc. 6th ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(90)90035-G_BIB12","article-title":"Lectures on a calculus for communicating systems","author":"Milner","year":"1985","journal-title":"Control Flow and Data Flow: Concepts of Distributed Programming"},{"key":"10.1016\/0304-3975(90)90035-G_BIB13","article-title":"An atomic calculus of communicating systems","author":"Obaid","year":"1987","journal-title":"IFIP WG 6.1, 7th Conf. on Protocol Specification, Testing and Verification"},{"key":"10.1016\/0304-3975(90)90035-G_BIB14","series-title":"Technical Report DAIMI FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090035G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090035G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:26Z","timestamp":1555113086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090035G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090035G"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90035-g","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}