{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T19:54:16Z","timestamp":1672602856709},"reference-count":16,"publisher":"Elsevier BV","issue":"28","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,6,20]],"date-time":"2015-06-20T00:00:00Z","timestamp":1434758400000},"content-version":"vor","delay-in-days":1480,"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":[[2011,6]]},"DOI":"10.1016\/j.tcs.2011.02.033","type":"journal-article","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T20:10:52Z","timestamp":1299010252000},"page":"3035-3044","source":"Crossref","is-referenced-by-count":3,"title":["On the axiomatizability of priority II"],"prefix":"10.1016","volume":"412","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Taolue","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2011.02.033_br000005","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1017\/S0960129507006524","article-title":"On the axiomatisability of priority","volume":"18","author":"Aceto","year":"2008","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"10.1016\/j.tcs.2011.02.033_br000010","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-1986-9202","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.tcs.2011.02.033_br000015","unstructured":"J.A. Bergstra, Put and get, primitives for synchronous unreliable message passing, Logic Group Preprint Series Nr. 3, CIF, State University of Utrecht, 1985."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2011.02.033_br000020","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":"Information and Control"},{"issue":"6","key":"10.1016\/j.tcs.2011.02.033_br000025","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1145\/227683.227687","article-title":"Equational specifications, complete term rewriting systems, and computable and semicomputable algebras","volume":"42","author":"Bergstra","year":"1995","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2011.02.033_br000030","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can\u2019t be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2011.02.033_br000035","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1995.1003","article-title":"CCS with priority choice","volume":"116","author":"Camilleri","year":"1995","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2011.02.033_br000040","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","article-title":"Priorities in process algebras","volume":"87","author":"Cleaveland","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2011.02.033_br000045","series-title":"Handbook of Process Algebra","first-page":"711","article-title":"Priorities in process algebra","author":"Cleaveland","year":"2001"},{"key":"10.1016\/j.tcs.2011.02.033_br000050","series-title":"Handbook of Process Algebra","first-page":"3","article-title":"The linear time-branching time spectrum. I. The semantics of concrete, sequential processes","author":"van Glabbeek","year":"2001"},{"key":"10.1016\/j.tcs.2011.02.033_br000055","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"issue":"2","key":"10.1016\/j.tcs.2011.02.033_br000060","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1995.1039","article-title":"On deciding readiness and failure equivalences for processes","volume":"117","author":"Huynh","year":"1995","journal-title":"Information and Computation"},{"issue":"4\u20135","key":"10.1016\/j.tcs.2011.02.033_br000065","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1142\/S0218196795000227","article-title":"Algorithmic problems in varieties","volume":"5","author":"Kharlampovich","year":"1995","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/j.tcs.2011.02.033_br000070","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/j.tcs.2011.02.033_br000075","series-title":"5th GI Conference","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/j.tcs.2011.02.033_br000080","first-page":"17","article-title":"A structural approach to operational semantics","volume":"60\u201361","author":"Plotkin","year":"2004","journal-title":"J. Logic Algebraic Program."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511001575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511001575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T16:44:19Z","timestamp":1637340259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511001575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":16,"journal-issue":{"issue":"28","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S0304397511001575"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.02.033","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}