{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T00:31:39Z","timestamp":1784334699692,"version":"3.55.0"},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0304-3975(92)90054-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"337-359","source":"Crossref","is-referenced-by-count":83,"title":["Defining conditional independence using collapses"],"prefix":"10.1016","volume":"101","author":[{"given":"Shmuel","family":"Katz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(92)90054-J_BIB1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/29873.29875","article-title":"Automatic translation of FORTRAN programs to vector form","volume":"9","author":"Allen","year":"1987","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"4","key":"10.1016\/0304-3975(92)90054-J_BIB2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","article-title":"Appraising fairness in languages for distributed programming","volume":"2","author":"Apt","year":"1988","journal-title":"Distrib. Comput."},{"key":"10.1016\/0304-3975(92)90054-J_BIB3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","article-title":"Proving assertions about parallel programs","volume":"10","author":"Ashkroft","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90054-J_BIB4","article-title":"Refining atomicity in parallel algorithms","author":"Back","year":"1988","journal-title":"\u00c5bo Akademi"},{"key":"10.1016\/0304-3975(92)90054-J_BIB5","first-page":"115","article-title":"Stepwise refinement of action systems","volume":"Vol. 375","author":"Back","year":"1989"},{"key":"10.1016\/0304-3975(92)90054-J_BIB6","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/PGEC.1966.264565","article-title":"Analysis of programs for parallel processing","volume":"15","author":"Bernstein","year":"1966","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90054-J_BIB7","series-title":"Concurrency Control and Recovery in Database Systems","author":"Bernstein","year":"1987"},{"key":"10.1016\/0304-3975(92)90054-J_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6423(89)90014-2","article-title":"Semantic independence","volume":"13","author":"Best","year":"1989","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(92)90054-J_BIB9_1","series-title":"Technical Report EWD-123","article-title":"Cooperating sequential processes","author":"Dijkstra","year":"1965"},{"key":"10.1016\/0304-3975(92)90054-J_BIB9_2","first-page":"43","year":"1968"},{"key":"10.1016\/0304-3975(92)90054-J_BIB10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminancy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90054-J_BIB11","first-page":"195","article-title":"Concurrency, automata and domains","volume":"Vol. 443","author":"Droste","year":"1990"},{"key":"10.1016\/0304-3975(92)90054-J_BIB12","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(92)90054-J_BIB13","first-page":"467","article-title":"Modeling concurrency by partial orders and nonlinear transition systems","volume":"Vol. 354","author":"Gaifman","year":"1989"},{"key":"10.1016\/0304-3975(92)90054-J_BIB14","first-page":"330","article-title":"On proving communication closedness of distributed layers","volume":"Vol. 241","author":"Gerth","year":"1986"},{"key":"10.1016\/0304-3975(92)90054-J_BIB15","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(92)90054-J_BIB16","first-page":"73","article-title":"Towards a theory of simulations for verification of concurrent systems","volume":"Vol. 366","author":"Janicki","year":"1989"},{"key":"10.1016\/0304-3975(92)90054-J_BIB17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(90)90096-Z","article-title":"Interleaving set temporal logic","volume":"75","author":"Katz","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90054-J_BIB18","first-page":"489","article-title":"An efficient verification method for parallel and distributed programs","volume":"Vol. 354","author":"Katz","year":"1989"},{"key":"10.1016\/0304-3975(92)90054-J_BIB19","article-title":"Verification of distributed programs using representative interleaving sequences","author":"Katz","year":"1990","journal-title":"Distrib. Comput."},{"key":"10.1016\/0304-3975(92)90054-J_BIB20","series-title":"Ph.D. thesis","article-title":"Fairness for noninterleaving concurrency","author":"Kwiatkowska","year":"1989"},{"key":"10.1016\/0304-3975(92)90054-J_BIB21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication, part I: basic formalism","volume":"1","author":"Lamport","year":"1986","journal-title":"Distrib. Comput."},{"key":"10.1016\/0304-3975(92)90054-J_BIB22","article-title":"Pretending atomicity","author":"Lamport","year":"1989","journal-title":"Research Report 44"},{"key":"10.1016\/0304-3975(92)90054-J_BIB23","series-title":"Proc. ACM Symp. on Principles of Programming Languages","first-page":"141","article-title":"How to cook a temporal proof system for your pet language","author":"Manna","year":"1983"},{"key":"10.1016\/0304-3975(92)90054-J_BIB24","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(92)90054-J_BIB25","first-page":"279","article-title":"Trace theory","volume":"Vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/0304-3975(92)90054-J_BIB26","series-title":"Report No. 86-06","article-title":"Complete processes and inevitability","author":"Mazurkiewicz","year":"1986"},{"key":"10.1016\/0304-3975(92)90054-J_BIB27","first-page":"430","article-title":"Semi-commutation and deterministic Petri nets","volume":"Vol. 452","author":"Ochmanski","year":"1990"},{"issue":"4","key":"10.1016\/0304-3975(92)90054-J_BIB28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(92)90054-J_BIB29","first-page":"232","article-title":"Specifying and proving serializability in temporal logic","author":"Peled","year":"1991","journal-title":"Proc. 6th IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90054-J_BIB30","first-page":"553","article-title":"Proving partial order liveness properties","author":"Peled","year":"1990"},{"key":"10.1016\/0304-3975(92)90054-J_BIB31","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"},{"key":"10.1016\/0304-3975(92)90054-J_BIB32","first-page":"510","article-title":"Applications of temporal logic to the specification and verification of reactive systems, a survey of current trends","volume":"Vol. 224","author":"Pnueli","year":"1986"},{"key":"10.1016\/0304-3975(92)90054-J_BIB33","series-title":"Proc. 18th Symp. on Foundations of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0304-3975(92)90054-J_BIB34","first-page":"121","article-title":"Temporal logic and causality in concurrent systems","volume":"Vol. 335","author":"Reisig","year":"1988"},{"key":"10.1016\/0304-3975(92)90054-J_BIB35","unstructured":"F.A. Stomp and W.P. de Roever, A formalization of sequentially phased intuition in network protocols, Report 88-15, Department of Informatics, Faculty of Science, University of Nijmegen, The Netherlands."},{"key":"10.1016\/0304-3975(92)90054-J_BIB36","first-page":"1","article-title":"Stubborn sets for reduced state space generation","volume":"Vol. 2","author":"Valmari","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290054J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290054J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:34Z","timestamp":1555077454000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290054J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["030439759290054J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90054-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}