{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:55Z","timestamp":1725678115555},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_47","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"498-508","source":"Crossref","is-referenced-by-count":3,"title":["Proving Liveness Property under Strengthened Compassion Requirements"],"prefix":"10.1007","author":[{"given":"Teng","family":"Long","sequence":"first","affiliation":[]},{"given":"Wenhui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Lehmann, D.J., Pnueli, A., Stavi, J.: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. In: ICALP 1981, vol.\u00a0115, pp. 264\u2013277. Springer, Heidelberg (1981)","key":"47_CR1","DOI":"10.1007\/3-540-10843-2_22"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-78163-9_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Pnueli","year":"2008","unstructured":"Pnueli, A., Sa\u2019ar, Y.: All You Need Is Compassion. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 233\u2013247. Springer, Heidelberg (2008)"},{"issue":"2","key":"47_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Software Eng.\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Trans. Software Eng."},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11945529_28","volume-title":"Principles of Distributed Systems","author":"M. Fischer","year":"2006","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 395\u2013409. Springer, Heidelberg (2006)"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11795490_10","volume-title":"Principles of Distributed Systems","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing Population Protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 103\u2013117. Springer, Heidelberg (2006)"},{"issue":"11","key":"47_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(91)90041-Y","volume":"83","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: Completing the temporal picture. Theor. Comput. Sci.\u00a083(1), 91\u2013130 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-642-02658-4_59","volume-title":"Computer Aided Verification","author":"J. Sun","year":"2009","unstructured":"Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 709\u2013714. Springer, Heidelberg (2009)"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/inco.2000.3000","volume":"163","author":"Y. Kesten","year":"2000","unstructured":"Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Inf. Comput.\u00a0163(1), 203\u2013243 (2000)","journal-title":"Inf. Comput."},{"issue":"1","key":"47_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129054107004553","volume":"18","author":"I. Balaban","year":"2007","unstructured":"Balaban, I., Pnueli, A., Zuck, L.D.: Modular ranking abstraction. Int. J. Found. Comput. Sci.\u00a018(1), 5\u201344 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-15643-4_21","volume-title":"Automated Technology for Verification and Analysis","author":"T. Long","year":"2010","unstructured":"Long, T., Zhang, W.: Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol.\u00a06252, pp. 276\u2013290. Springer, Heidelberg (2010)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-11512-7_14","volume-title":"Concurrency, Compositionality, and Correctness","author":"I. Balaban","year":"2010","unstructured":"Balaban, I., Pnueli, A., Zuck, L.D.: Proving the Refuted: Symbolic Model Checkers as Proof Generators. In: Dams, D., Hannemann, U., Steffen, M. (eds.) Concurrency, Compositionality, and Correctness. LNCS, vol.\u00a05930, pp. 221\u2013236. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: STOC, pp. 278\u2013290 (1983)","key":"47_CR13","DOI":"10.1145\/800061.808757"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13754-9_13","volume-title":"Time for Verification","author":"Z. Manna","year":"2010","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Response. In: Manna, Z., Peled, D.A. (eds.) Time for Verification. LNCS, vol.\u00a06200, pp. 279\u2013361. Springer, Heidelberg (2010)"},{"issue":"1&2","key":"47_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(93)90185-V","volume":"111","author":"M.G. Main","year":"1993","unstructured":"Main, M.G.: Complete proof rules for strong fairness and strong extreme fairness. Theor. Comput. Sci.\u00a0111(1&2), 125\u2013143 (1993)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Long, T., Zhang, W.: Proving liveness property under strengthened compassion requirements. Technical Report, ISCAS\u2013SKLCS\u201312\u201301, Institute of Sofware, Chinese Academy of Sciences (2012), \n                    \n                      http:\/\/lcs.ios.ac.cn\/~zwh\/tr\/","key":"47_CR16","DOI":"10.1007\/978-3-642-29952-0_47"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:03Z","timestamp":1620127383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}