{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:38:36Z","timestamp":1740141516846,"version":"3.37.3"},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"vor","delay-in-days":589,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6,7]]},"DOI":"10.1093\/logcom\/exv032","type":"journal-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T23:02:33Z","timestamp":1433977353000},"page":"779-807","source":"Crossref","is-referenced-by-count":0,"title":["On fixpoint logics and equivalences for processes with restricted nondeterminism"],"prefix":"10.1093","volume":"28","author":[{"given":"Julian","family":"Gutierrez","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Oxford, Wolfson building, Parks road, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,6,8]]},"reference":[{"key":"key\n\t\t\t\t20180607120735_B1","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","article-title":"Alternating-time temporal logic","volume":"49","author":"Alur","year":"2002","journal-title":"Journal of the ACM"},{"key":"key\n\t\t\t\t20180607120735_B2"},{"key":"key\n\t\t\t\t20180607120735_B3","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2629638","article-title":"A logic for true concurrency","volume":"61","author":"Baldan","year":"2014","journal-title":"Journal of the ACM"},{"key":"key\n\t\t\t\t20180607120735_B4","first-page":"283","article-title":"Logic games, from tools to models of interaction","volume-title":"Logic at the Crossroads","author":"Benthem","year":"2007"},{"key":"key\n\t\t\t\t20180607120735_B5","first-page":"47","article-title":"Independence: logics and concurrency","volume-title":"Truth and Games: Essays in Honour of Gabriel Sandu","author":"Bradfield","year":"2006"},{"key":"key\n\t\t\t\t20180607120735_B6","first-page":"102","article-title":"Independence-friendly modal logic and true concurrency","volume":"9","author":"Bradfield","year":"2002","journal-title":"Nordic Journal of Computing"},{"key":"key\n\t\t\t\t20180607120735_B7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/S1570-2464(07)80015-2","article-title":"Modal mu-calculi","volume-title":"Handbook of Modal Logic","author":"Bradfield","year":"2007"},{"key":"key\n\t\t\t\t20180607120735_B8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"Desel","year":"1995"},{"key":"key\n\t\t\t\t20180607120735_B9"},{"key":"key\n\t\t\t\t20180607120735_B10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s002360000041","article-title":"Refinement of actions and equivalence notions for concurrent systems","volume":"37","author":"Glabbeek","year":"2001","journal-title":"Acta Informatica"},{"key":"key\n\t\t\t\t20180607120735_B11"},{"key":"key\n\t\t\t\t20180607120735_B12"},{"key":"key\n\t\t\t\t20180607120735_B13","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.ic.2010.12.002","article-title":"Model-checking games for fixpoint logics with partial order models","volume":"209","author":"Gutierrez","year":"2011","journal-title":"Information and Computation"},{"key":"key\n\t\t\t\t20180607120735_B14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"Journal of the ACM"},{"volume-title":"Communicating Sequential Processes","year":"2004","author":"Hoare","key":"key\n\t\t\t\t20180607120735_B15"},{"key":"key\n\t\t\t\t20180607120735_B16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","article-title":"Deciding true concurrency equivalences on safe, finite nets","volume":"154","author":"Jategaonkar","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional mu-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"volume-title":"Communication and Concurrency","year":"1989","author":"Milner","key":"key\n\t\t\t\t20180607120735_B18"},{"key":"key\n\t\t\t\t20180607120735_B19","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1145\/201019.201032","article-title":"Three logics for branching bisimulation","volume":"42","author":"Nicola","year":"1995","journal-title":"Journal of the ACM"},{"key":"key\n\t\t\t\t20180607120735_B20","first-page":"221","article-title":"Games and logics for a noninterleaving bisimulation","volume":"2","author":"Nielsen","year":"1995","journal-title":"Nordic Journal of Computing"},{"key":"key\n\t\t\t\t20180607120735_B21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures and domains","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B22","first-page":"1","article-title":"Models for concurrency","volume-title":"Handbook of Logic in Computer Science","author":"Nielsen","year":"1995"},{"key":"key\n\t\t\t\t20180607120735_B23","first-page":"179","article-title":"Branching time and partial order in temporal logics","volume-title":"Time and Logic: A Computational Approach","author":"Penczek","year":"1995"},{"key":"key\n\t\t\t\t20180607120735_B24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1142\/9789814261456_0010","article-title":"Traces and logic","volume-title":"The Book of Traces","author":"Penczek","year":"1995"},{"key":"key\n\t\t\t\t20180607120735_B25","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1017\/S0960129511000429","article-title":"A hierarchy of reverse bisimulations on stable configuration structures","volume":"22","author":"Phillips","year":"2012","journal-title":"Mathematical Structures in Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129513000510","article-title":"Event identifier logic","volume":"24","author":"Phillips","year":"2014","journal-title":"Mathematical Structures in Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","article-title":"Models for concurrency: towards a classification","volume":"170","author":"Sassone","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(95)00123-9","article-title":"On the border of causality: Contact and confusion","volume":"153","author":"Smith","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120735_B29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","article-title":"Bisimulation, modal logic and model checking games","volume":"7","author":"Stirling","year":"1999","journal-title":"Logic Journal of IGPL"},{"key":"key\n\t\t\t\t20180607120735_B30"},{"key":"key\n\t\t\t\t20180607120735_B31","first-page":"561","article-title":"Event structure semantics for CCS and related languages","volume":"140","author":"Winskel","year":"1982","journal-title":"Proceedings of the 9th Colloquium on Automata, Languages and Programming (ICALP)"},{"volume-title":"An Introduction to MultiAgent Systems","year":"2009","author":"Wooldridge","key":"key\n\t\t\t\t20180607120735_B32"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/28\/4\/779\/25020838\/exv032.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T11:26:41Z","timestamp":1566818801000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/28\/4\/779\/2917810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,8]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,6,8]]},"published-print":{"date-parts":[[2018,6,7]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv032","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published-other":{"date-parts":[[2018,6]]},"published":{"date-parts":[[2015,6,8]]}}}