{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:17Z","timestamp":1725456977619},"publisher-location":"Berlin\/Heidelberg","reference-count":43,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032058","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"553-571","source":"Crossref","is-referenced-by-count":10,"title":["Proving partial order liveness properties"],"prefix":"10.1007","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00289262","volume":"15","author":"K. R. Apt","year":"1981","unstructured":"K. R. Apt, Recursive Assertions and Parallel Programs, Acta Informatica 15(1981), 219\u2013232.","journal-title":"Acta Informatica"},{"issue":"4","key":"42_CR2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K. Apt","year":"1988","unstructured":"K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, Vol 2, No 4, 1988, 226\u2013241.","journal-title":"Distributed Computing"},{"key":"42_CR3","unstructured":"P. A. Bernstein, V. Hadzilacos, N. Goodman, Concurrency control and Recovery in Database Systems, Addison-Wesley, 1987."},{"issue":"1","key":"42_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy, L. Lamport, Distributed Snaphshots: determining the global state of distributed systems, ACM Transactions on Computer Systems 3 (1), 1985, 63\u201375.","journal-title":"ACM Transactions on Computer Systems"},{"key":"42_CR5","series-title":"Technical Report","volume-title":"Cooperating Sequential Processes","author":"E. W. Dijkstra","year":"1965","unstructured":"E. W. Dijkstra, Cooperating Sequential Processes, Technical Report EWD-123, Technological University, Eindhoven, The Netherlands, 1965, Reprinted in: F. Genuys (Editor), Programming languages, Academic Press, London, 1968, 43\u2013112."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E.W. Dijkstra","year":"1975","unstructured":"E.W. Dijkstra, Guarded commands, Nondeterminancy and Formal Derivation of Programs, Communication of the ACM, 18(1975), 453\u2013457.","journal-title":"Communication of the ACM"},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. 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":"42_CR8","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":"42_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. A. Emerson","year":"1982","unstructured":"E. A. Emerson, E. M. Clarke, Using branching time temporal logic to synthesize synchronization skeletons, Science of Computer Programming 2, 1982, 241\u2013266.","journal-title":"Science of Computer Programming"},{"key":"42_CR10","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, \u201cSometimes\u201d and \u201cnot never\u201d revisited: on branching versus linear time temporal logic, Journal of the ACM 33(1986), 151\u2013178.","journal-title":"Journal of the ACM"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"N. Francez, Fairness, Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"N. Francez, D. Kozen, Generalized Fair Termination, Proc. 11 th Symposium on Principles of Programming Languages, Salt Lake City, 1984.","DOI":"10.1145\/800017.800515"},{"key":"42_CR13","unstructured":"H. Gaifman, V. Pratt, Partial Order Models of Concurrency and Computation of Functions, Symposium on Logic in Computer Science, 1987, 72\u201385."},{"key":"42_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0019-9958(85)80014-0","volume":"66","author":"O. Gr\u00fcmberg","year":"1985","unstructured":"O. Gr\u00fcmberg, N. Francez, J. A. Makowski, W. P. de Roever, A proof rule for termination of guarded commands, Information and Control, 66, 1985, 83\u2013102.","journal-title":"Information and Control"},{"key":"42_CR15","unstructured":"D. Harel, First order Dynamic Logic, Lecture Notes in Computer Science 68."},{"key":"42_CR16","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.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":"42_CR17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(86)90177-5","volume":"43","author":"R. Janicki","year":"1986","unstructured":"R. Janicki, P. E. Lauer, M. Koutny, R. Devillers, Concurrent and maximally Concurrent Evolution of Non-Sequential System, Theoretical Computer Science, 43(1986), 213\u2013238.","journal-title":"Theoretical Computer Science"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"S. Katz, D. Peled, Interleaving Set Temporal Logic, 6 th ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1987, 178\u2013190.","DOI":"10.1145\/41840.41855"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"S. Katz, D. Peled, An efficient verification method for parallel and distributed programs, Rex workshop on Linear Time, Branching Time and Partial order in Logics and models for Concurrency, Noordwijkerhout, The Netherlands, May\/June 1988, Lecture Notes on Computer Science 354, 489\u2013507.","DOI":"10.1007\/BFb0013032"},{"key":"42_CR20","unstructured":"S. Katz, D. Peled, Defining Conditional Independence Using Collapses, to appear in BCS-FACS Workshop on Semantics for Concurrency, July 90."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"M. Z. Kwiatkowska, Fairness for Non-interleaving Concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.","DOI":"10.1007\/BF01887206"},{"key":"42_CR22","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":"42_CR23","doi-asserted-by":"crossref","unstructured":"D. Lehman, A. Pnueli, J. Stavi, Impartiality, Justice and Fairness: The ethics of concurrent termination. Proc. of 8 th International colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 115, 264\u2013277.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"42_CR24","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 and J.S. Moore, 1981, 215\u2013273.","DOI":"10.21236\/ADA106750"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, Verification of concurrent programs, a temporal proof system, Proceedings of the 4 th School on Advanced Programming, Amsterdam, Holland, June 1982, 162\u2013255.","DOI":"10.21236\/ADA116035"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, How to cook a temporal proof system for your pet language. Proceedings of the Symposium on Principles on Programming Languages, Austin, Texas, 1983, 141\u2013151.","DOI":"10.1145\/567067.567082"},{"key":"42_CR27","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":"42_CR28","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, The Anchored Version of the Temporal Framework, School\/Workshop on Linear Time, Branching Time and Partial order in Logics and Models, The Netherlands, Lecture Notes on Computer Science, 254, 201\u2013281.","DOI":"10.1007\/BFb0013024"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Pnueli, Completing the Temporal Picture, Proceedings 16 th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 372, 534\u2013558.","DOI":"10.21236\/ADA328579"},{"key":"42_CR30","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Z. Manna, P. Wolper, Synthesis of communicating processes from temporal logic specifications, ACM Transactions on Programming Languages and Systems 6, 1984, 68\u201393.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"42_CR31","unstructured":"A. Mazurkiewicz, Trace semantics, Proceedings of an advanced course, Bad Honnef, September 1986, Lecture Notes in Computer Science, 255."},{"key":"42_CR32","volume-title":"Complete Processes and Inevitability, Rept. No. 86-06","author":"A. Mazurkiewicz","year":"1986","unstructured":"A. Mazurkiewicz, Complete Processes and Inevitability, Rept. No. 86-06, Univ. of Leiden, The Netherlands, 1986."},{"key":"42_CR33","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13(1981), 85\u2013108.","journal-title":"Theoretical Computer Science"},{"key":"42_CR34","doi-asserted-by":"crossref","unstructured":"S. Owicki, A consistent and complete deductive system for the verification of parallel programs, Proceedings of the 8 th Annual Symposium, on Theory of Computing, 1976, 73\u201386.","DOI":"10.1145\/800113.803634"},{"key":"42_CR35","unstructured":"D. Peled, A. Pnueli, Proving Partial Order Liveness Properties, Technical Report, Weizmann Institute of Science, 1990."},{"key":"42_CR36","unstructured":"C. A. Petri, Kommunikation mit Automaten, Bonn: Institut f\u00fcr Instrumentelle Matematik, Schriften des IIM Nr. 2(1962)."},{"key":"42_CR37","doi-asserted-by":"crossref","unstructured":"S. Pinter, P. Wolper, A temporal logic for reasoning about partially ordered computations, Proceedings of the 3 rd ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., August 1984, 23\u201327.","DOI":"10.1145\/800222.806733"},{"key":"42_CR38","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, On the Synthesis of an Asynchronous Reactive Module, 16 th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 372, 652\u2013671.","DOI":"10.1007\/BFb0035790"},{"key":"42_CR39","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":"42_CR40","doi-asserted-by":"crossref","unstructured":"W. Reisig, Temporal Logic and Causality in Concurrent Systems, Proceedings of CONCURRENCY 88, Hamburg, Lecture Notes in Computer Science, 1988, 121\u2013139.","DOI":"10.1007\/3-540-50403-6_37"},{"key":"42_CR41","unstructured":"J. R. Shoenfield, Mathematical Logic, Addison-Wesley 1976."},{"key":"42_CR42","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan, Elementary Net Systems, Lecture Notes in Computer Science 254, 26\u201359.","DOI":"10.1007\/978-3-540-47919-2_3"},{"key":"42_CR43","unstructured":"G. Winskel, Event Structures, Proceedings of an advanced course, Bad Honnef, September 1986, Lecture Noted in Computer Science, 255."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:07Z","timestamp":1586612707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/bfb0032058","relation":{},"subject":[]}}