{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T08:47:24Z","timestamp":1766047644179},"reference-count":39,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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,10]]},"DOI":"10.1016\/0304-3975(90)90096-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"263-287","source":"Crossref","is-referenced-by-count":32,"title":["Interleaving set temporal logic"],"prefix":"10.1016","volume":"75","author":[{"given":"Shmuel","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90096-Z_BIB1","series-title":"Ph.D. thesis","article-title":"Decidability and expressiveness of logics of programs","author":"Abrahamson","year":"1980"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB2","article-title":"Appraising fairness in languages for distributed programming","author":"Apt","year":"1987","journal-title":"14th Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A proof system for Communicating Sequential Processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01257083","article-title":"The temporal logic of branching time","volume":"20","author":"Ben-Ari","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00289593","article-title":"A formal model of atomicity in asynchronous systems","volume":"16","author":"Best","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB6","series-title":"Proc. TAPSOFT 87","first-page":"123","article-title":"On the semantics of concurrency: partial orders and transition systems","volume":"249","author":"Boudol","year":"1987"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB7","series-title":"Tech. Rep. No. 84","article-title":"Repeated snapshots in synchronous systems and their implementation in CSP","author":"Bouge","year":"1985"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB9","series-title":"Logics of Programs Workshop","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1981"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB10","first-page":"283","article-title":"Reasoning about fair concurrent programs","author":"Courcoubetis","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB11","series-title":"Proc. FCT 85","first-page":"520","article-title":"Partial ordering for CCS","volume":"199","author":"Degano","year":"1985"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB12","unstructured":"E.W. Dijkstra, The distributed snapshot algorithm of K.M. Chandy and L. Lamport, unpublished."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","article-title":"Decomposition of distributed programs into communication-closed layers","volume":"2","author":"Elrad","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(83)90082-8","article-title":"Alternative semantics for temporal logic","volume":"26","author":"Emerson","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cnot never\u201d revisited: on branching versus linear time temporal logic","volume":"33","author":"Emerson","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","article-title":"Decision procedures and expressiveness in temporal logic of branching time","volume":"30","author":"Emerson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB17","series-title":"Texts and Monographs in Computer Science","article-title":"Fairness","author":"Francez","year":"1986"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB18","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0020-0190(81)90100-9","article-title":"An implementation of P and V","volume":"12","author":"Hehner","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB19","first-page":"13","article-title":"Axioms for concurrent objects","author":"Herlihy","year":"1987","journal-title":"14th Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB20","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB21","series-title":"Technical report of the Faculty of Electrical Engineering","article-title":"Hyper finite state systems: a hypergraph model for distributed finite systems","author":"Kornatzki","year":"1986"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB22","series-title":"Distributed Systems\u2014Methods and Tools for Specification, An Advance Course","first-page":"454","article-title":"Paradigms for distributed programs: computing global states","volume":"190","author":"Lamport","year":"1985"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB23","first-page":"657","article-title":"What good is temporal logic?","author":"Lamport","year":"1983","journal-title":"Proc. IFIP 9th World Congress"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB24","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication","volume":"1","author":"Lamport","year":"1986","journal-title":"Distributed Comput."},{"key":"10.1016\/0304-3975(90)90096-Z_BIB25","first-page":"78","article-title":"What it means for a concurrent program to satisfy a specification: why no one has specified priority","author":"Lamport","year":"1985","journal-title":"Proc. 12th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB26","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB27","author":"Lamport","year":"1987","journal-title":"Atomicity in distributed algorithms"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB28","series-title":"Proc. 8th ICALP","article-title":"Impartiality, justice, fairness: the ethics of concurrent termination","volume":"115","author":"Lehman","year":"1981"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB29","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(82)91022-1","article-title":"Reasoning with time and chance","volume":"53","author":"Lehman","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB30","first-page":"215","article-title":"Verification of concurrent programs: the temporal framework","author":"Manna","year":"1981","journal-title":"The Correctness Problem in Computer Science"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0167-6423(84)90003-0","article-title":"Adequate proof principles for invariance and liveness properties of concurrent programs","volume":"4","author":"Manna","year":"1984","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB32","first-page":"141","article-title":"How to cook a temporal proof system for your pet language","author":"Manna","year":"1983","journal-title":"10th Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB33","series-title":"Proc. of an advanced Course","article-title":"Trade semantics","volume":"255","author":"Mazurkiewicz","year":"1986"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB34","article-title":"A Calculus of Communicating System","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB35","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB36","first-page":"28","article-title":"A temporal logic for reasoning about partially ordered computations","author":"Pinter","year":"1984","journal-title":"Proc. 3rd ACM Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB37","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modeling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB38","series-title":"11th ICALP","first-page":"403","article-title":"Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness","volume":"172","author":"Reisig","year":"1984"},{"key":"10.1016\/0304-3975(90)90096-Z_BIB39","series-title":"Proc. of an Advanced Course","article-title":"Event structures","volume":"255","author":"Winskel","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090096Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090096Z?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:52:15Z","timestamp":1555113135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090096Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["030439759090096Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90096-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}