{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:35Z","timestamp":1725663455514},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518037"},{"type":"electronic","value":"9783540468110"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51803-7_20","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:16:27Z","timestamp":1330204587000},"page":"21-43","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Interleaving set temporal logic"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"2_CR1","unstructured":"K. Abrahamson, Decidability and expressiveness of logics of programs, Ph.D. thesis, University of Washington at Seattle, 1980."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, 14th Symposium on principles of programming languages, Munich, West Germany, 1987.","DOI":"10.1145\/41625.41642"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K. R. Apt","year":"1980","unstructured":"K.R. Apt, N. Francez, W.P. de Roever, A proof system for Communicating Sequential Processes, ACM TOPLAS Vol 2(1980), 359\u2013385.","journal-title":"ACM TOPLAS"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01257083","volume":"20","author":"M. Ben-Ari","year":"1983","unstructured":"M. Ben-Ari, Z. Manna, A. Pnueli, The temporal logic of branching time, Acta informatica 20(1983), 207\u2013226.","journal-title":"Acta informatica"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00289593","volume":"16","author":"E. Best","year":"1981","unstructured":"E. Best, B. Randell, A formal model of atomicity in asynchronous systems, Acta informatica, 16(1981), 93\u2013124.","journal-title":"Acta informatica"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, On the semantics of concurrency: Partial orders and transition systems. In: proceeding TAPSOFT 87,Lecture Notes in Computer Science, Springer-Verlag, 249, 123\u2013137.","DOI":"10.1007\/3-540-17660-8_52"},{"key":"2_CR7","series-title":"Tech. Rep.","volume-title":"Repeated snapshots in synchronous systems and their implementation in CSP","author":"L. Bouge","year":"1985","unstructured":"L. Bouge, Repeated snapshots in synchronous systems and their implementation in CSP, Tech. Rep. No 84, L.I.T.P., Universite Paris 7, Paris, October 1985."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"K.M. Chandy, L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, Vol. 3, No. 1, 63\u201375.","DOI":"10.1145\/214451.214456"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logics of programs Workshop, Yorktown Heights, New York, 1981, Lecture Notes in Computer Science, Springer-Verlag, 131, 52\u201371.","DOI":"10.1007\/BFb0025774"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"C. Courcoubetis, M.Y. Vardi, P. Wolper, Reasoning about fair concurrent programs,Proc. 18th ACM Symposium on theory of computing, Berkeley, California, 1986, 283\u2013294.","DOI":"10.1145\/12130.12159"},{"key":"2_CR11","unstructured":"P. Degano, R. De Nicola, U. Montanari, Partial ordering for CCS. In: Proceeding FCT 85, Lecture Notes in Computer Science, Springer-Verlag, 199, 520\u2013533."},{"key":"2_CR12","unstructured":"E.W. Dijkstra, The distributed snapshot algorithm of K.M. Chandy and L. Lamport, EWD864a."},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"Tz. Elrad","year":"1982","unstructured":"Tz. Elrad, N. Francez, Decomposition of distributed programs into communication-closed layers, Science of Computer Programming 2(1982), 155\u2013173","journal-title":"Science of Computer Programming"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(83)90082-8","volume":"26","author":"E. A. Emerson","year":"1983","unstructured":"E.A. Emerson, Alternative semantics for temporal logic, Theoretical Computer Science 26(1983), 121\u2013130.","journal-title":"Theoretical Computer Science"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E. A. Emerson","year":"1986","unstructured":"E.A. Emerson, J.Y. Halpern, \"Sometimes\" and \"not never\" revisited: on branching versus linear time temporal logic, Journal of the ACM 33(1986), 151\u2013178.","journal-title":"Journal of the ACM"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","volume":"30","author":"E. A. Emerson","year":"1985","unstructured":"E.A. Emerson, J.Y. Halpern, Decision procedures and expressiveness in temporal logic of branching time, Journal of Computer and System Science, 30, 1985, 1\u201324.","journal-title":"Journal of Computer and System Science"},{"key":"2_CR17","unstructured":"E.A. Emerson, C.L. Lei, Temporal model checking under generalized fairness constraints, Proc. 18th Hawaii International Conference on System Sciences, 1985, 277\u2013288."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.L. Lei, Modalities for model checking: Branching time strikes back, Proc. 12th ACM Symposium on principles of programming languages, New Orleans, Louisiana, 1985, 84\u201396.","DOI":"10.1145\/318593.318620"},{"key":"2_CR19","volume-title":"Fairness, texts and monographs in computer science","author":"N. Francez","year":"1986","unstructured":"N. Francez, Fairness, texts and monographs in computer science (D. Gries, ed.), Springer-Verlag, New York, 1986."},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0020-0190(81)90100-9","volume":"12","author":"E. C. R. Hehner","year":"1981","unstructured":"[HS]E.C.R. Hehner, R.K. Shyamasundar, An implementation of P and V, Information Processing Letters, 12(1981), 196\u2013198.","journal-title":"Information Processing Letters"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"M.P. Herlihy, J.M. Wing, Axioms for concurrent objects, Fourteenth Symposium on Principles of Programming Languages, Munich, W.Germany, 1987, 13\u201326.","DOI":"10.21236\/ADA200584"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"C.A.R. Hoare, Communicating sequential processes, Communications of the ACM, 21(1978), 666\u2013677.","journal-title":"Communications of the ACM"},{"key":"2_CR23","volume-title":"Hyper finite state systems: A hypergraph model for distributed finite systems. Technical report of the faculty of electrical engineering","author":"Y. Kornatzki","year":"1986","unstructured":"Y. Kornatzki, S. Pinter, Hyper finite state systems: A hypergraph model for distributed finite systems. Technical report of the faculty of electrical engineering, Technion, Haifa, Israel, No. 586, June 1986."},{"key":"2_CR24","unstructured":"L. Lamport, Paradigms for distributed programs: computing global states, In: Distributed systems \u2014 Methods and tools for specification, An advanced course, Munich, 1985, Edited by M. Paul and H.J. Siegert, Lecture notes in Computer Science, Springer-Verlag, 190, 454\u2013468."},{"key":"2_CR25","unstructured":"L. Lamport, What good is temporal logic? Proceedings of IFIP 9th world congress, Paris, France, September 1983, 657\u2013668."},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, On interprocess communication, Distributed computing 1(1986), 77\u201385.","journal-title":"Distributed computing"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"L. Lamport, What it means for a concurrent program to satisfy a specification: why no one has specified priority, Proceedings of the 12th ACM Symposium on principles of programming languages, New Orleans, Louisiana, 1985, 78\u201383.","DOI":"10.1145\/318593.318616"},{"key":"2_CR28","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communication of the ACM, 21(1978), 558\u2013565.","journal-title":"Communication of the ACM"},{"key":"2_CR29","unstructured":"L. Lamport, Atomicity in distributed algorithms, Manuscript, 24 Jan 1987."},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"D. Lehman, A. Pnueli, J. Stavi, Impartiality, justice, fairness: the ethics of concurrent termination, Proceedings of 8th ICALP, Acco, Israel, July 1981, Lecture notes in computer science, Springer-Verlag, 115 (O. Kariv and S. Even, eds.), 1981.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"2_CR31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(82)91022-1","volume":"53","author":"D. Lehman","year":"1982","unstructured":"D. Lehman, S. Shelah, Reasoning with time and chance, Information and control 53(1982), 165\u2013198.","journal-title":"Information and control"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, Verification of concurrent programs: the temporal framework, In: The correctness problem in computer science, Edited by R.S. Boyer & J.S. Moore, 1981, 215\u2013273.","DOI":"10.21236\/ADA106750"},{"key":"2_CR33","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0167-6423(84)90003-0","volume":"4","author":"Z. Manna","year":"1984","unstructured":"Z. Manna, A. Pnueli, Adequate proof principles for invariance and liveness properties of concurrent programs, Science of computer programming 4(1984), 257\u2013289.","journal-title":"Science of computer programming"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, How to cook a temporal proof system for your pet language, 10th Symposium on principles of programming languages, Austin, Texas, 1983, 141\u2013154.","DOI":"10.1145\/567067.567082"},{"key":"2_CR35","unstructured":"R. Milner, A calculus of communicating system, Lecture Notes in Computer Science, Springer-Verlag, 92."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"S. Pinter and P. Wolper, A temporal logic for reasoning about partially ordered computations, Proceedings of 3rd ACM Principles of Distributed Computing, Vancouver, B.C., August 1984, 28\u201337.","DOI":"10.1145\/800222.806733"},{"key":"2_CR37","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, 15(1986), 33\u201371.","journal-title":"International Journal of Parallel Programming"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"W. Reisig, Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness, 11th ICALP, Antwerp, Belgium, 1984, Lecture notes in Computer Science, Springer-Verlag, 172, 403\u2013413.","DOI":"10.1007\/3-540-13345-3_37"}],"container-title":["Lecture Notes in Computer Science","Temporal Logic in Specification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51803-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:14:06Z","timestamp":1558268046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51803-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518037","9783540468110"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-51803-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"25 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}