{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:17:52Z","timestamp":1780049872365,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540208037","type":"print"},{"value":"9783540246220","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24622-0_19","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:33:53Z","timestamp":1283672033000},"page":"223-238","source":"Crossref","is-referenced-by-count":20,"title":["Liveness with Invisible Ranking"],"prefix":"10.1007","author":[{"given":"Yi","family":"Fang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lenore","family":"Zuck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Kozen, D.: Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters 22(6) (1986)","DOI":"10.1016\/0020-0190(86)90071-2"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-44585-4_19","volume-title":"Computer Aided Verification","author":"T. Arons","year":"2001","unstructured":"Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.: Parameterized verification with automatically computed inductive assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 221\u2013234. Springer, Heidelberg (2001)"},{"issue":"2","key":"19_CR3","first-page":"141","volume":"7","author":"K. Baukus","year":"2001","unstructured":"Baukus, K., Lakhnesche, Y., Stahl, K.: Verification of parameterized protocols. Journal of Universal Computer Science\u00a07(2), 141\u2013158 (2001)","journal-title":"Journal of Universal Computer Science"},{"key":"19_CR4","unstructured":"Bj\u00f8rner, N., Browne, I., Chang, E., Col\u00f3n, M., Kapur, A., Manna, Z., Sipma, H., Uribe, T.: STeP: The Stanford Temporal Prover, User\u2019s Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University (1995)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/3-540-60299-2_37","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"N. Bj\u00f8rner","year":"1995","unstructured":"Bj\u00f8rner, N., Browne, I., Manna, Z.: Automatic generation of invariants and intermediate assertions. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 589\u2013623. Springer, Heidelberg (1995)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/3-540-60218-6_30","volume-title":"CONCUR \u201995 Concurrency Theory","author":"E. Clarke","year":"1995","unstructured":"Clarke, E., Grumberg, O., Jha, S.: Verifying parametrized networks using abstraction and regular languages. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 395\u2013407. Springer, Heidelberg (1995)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45657-0_36","volume-title":"Computer Aided Verification","author":"M. Colon","year":"2002","unstructured":"Colon, M., Sipma, H.: Practical methods for proving program termination. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 442\u2013454. Springer, Heidelberg (2002)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"E. Emerson","year":"2000","unstructured":"Emerson, E., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 236\u2013255. Springer, Heidelberg (2000)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: POPL 1995 (1995)","DOI":"10.1145\/199448.199468"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/BFb0054187","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Gribomont","year":"1998","unstructured":"Gribomont, E., Zenner, G.: Automated verification of szymanski\u2019s algorithm. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 424\u2013438. Springer, Heidelberg (1998)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"V. Gyuris","year":"1997","unstructured":"Gyuris, V., Sistla, A.P.: On-the-fly model checking under fairness that exploits symmetry. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, Springer, Heidelberg (1997)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-46419-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Jonsson","year":"2000","unstructured":"Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, p. 220. Springer, Heidelberg (2000)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/s100090050040","volume":"4","author":"Y. Kesten","year":"2000","unstructured":"Kesten, Y., Pnueli, A.: Control and data abstractions: The cornerstones of practical formal verification. Software Tools for Technology Transfer\u00a04(2), 328\u2013342 (2000)","journal-title":"Software Tools for Technology Transfer"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-45694-5_8","volume-title":"CONCUR 2002 - Concurrency Theory","author":"Y. Kesten","year":"2002","unstructured":"Kesten, Y., Pnueli, A., Shahar, E., Zuck, L.: Network invariants in action. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 101\u2013105. Springer, Heidelberg (2002)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/360204.360210","volume-title":"Proceedings of the 28th ACMSIGPLAN-SIGACT symposium on Principles of programming languages","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N., Ben-Amram, A.: The size-change principle for program termination. In: Proceedings of the 28th ACMSIGPLAN-SIGACT symposium on Principles of programming languages, pp. 81\u201392. ACM Press, New York (2001)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Lesens, D., Halbwachs, N., Raymond, P.: Automatic verification of parameterized linear networks of processes. In: POPL 1997 (1997)","DOI":"10.1145\/263699.263747"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90041-Y","volume":"83","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: Completing the temporal picture. Theoretical Comput. Sci.\u00a083(1), 97\u2013130 (1991)","journal-title":"Theoretical Comput. Sci."},{"key":"19_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z. Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BFb0028738","volume-title":"Computer Aided Verification","author":"K. McMillan","year":"1998","unstructured":"McMillan, K.: Verification of an implementation of Tomasulo\u2019s algorithm by compositional model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 110\u2013121. Springer, Heidelberg (1998)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45319-9_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Pnueli","year":"2001","unstructured":"Pnueli, A., Ruah, S., Zuck, L.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 82\u201397. Springer, Heidelberg (2001)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-45657-0_9","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"2002","unstructured":"Pnueli, A., Xu, J., Zuck, L.: Liveness with (0, 1,\u221e)-counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 107\u2013122. Springer, Heidelberg (2002)"},{"key":"19_CR22","unstructured":"Shankar, N., Owre, S., Rushby, J.: The PVS proof checker:A reference manual. Technical report, Comp. Sci., Laboratory, SRI International, Menlo Park, CA (1993)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-47813-2_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L. Zuck","year":"2002","unstructured":"Zuck, L., Pnueli, A., Kesten, Y.: Automatic verification of free choice. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 208\u2013224. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24622-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T19:58:42Z","timestamp":1553025522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24622-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208037","9783540246220"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24622-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}