{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:56:35Z","timestamp":1742399795050},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_6","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"79-94","source":"Crossref","is-referenced-by-count":4,"title":["A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Leue","sequence":"first","affiliation":[]},{"given":"Alin","family":"\u015etef\u0103nescu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a030(2), 323\u2013342 (1983)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01384316","volume":"6","author":"J.C. Corbett","year":"1995","unstructured":"Corbett, J.C., Avrunin, G.S.: Using integer programming to verify general safety and liveness properties. Formal Methods in System Design\u00a06(1), 97\u2013123 (1995)","journal-title":"Formal Methods in System Design"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1007\/3-540-48118-4_11","volume-title":"FM\u201999 - Formal Methods","author":"S. Dellacherie","year":"1999","unstructured":"Dellacherie, S., Devulder, S., Lambert, J.-L.: Software Verification Based on Linear Programming. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol.\u00a01709, pp. 1147\u20131165. Springer, Heidelberg (1999)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10009-002-0092-3","volume":"4","author":"Y. Dong","year":"2003","unstructured":"Dong, Y., Du, X., Holzmann, G.J., Smolka, S.A.: Fighting livelock in the GNU i-Protocol: a case study in explicit-state model checking. Int. Journal on Software Tools for Technology Transfer (STTT)\u00a04(4), 505\u2013528 (2003)","journal-title":"Int. Journal on Software Tools for Technology Transfer (STTT)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Application and Theory of Petri Nets 1997","author":"J. Esparza","year":"1997","unstructured":"Esparza, J., Melzer, S.: Model checking LTL using constraint programming. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 1\u201320. Springer, Heidelberg (1997)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design\u00a016(2), 159\u2013189 (2000)","journal-title":"Formal Methods in System Design"},{"key":"6_CR7","unstructured":"FDR2 tool. Formal Systems (Europe) Ltd., http:\/\/www.fsel.com"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10703-005-1489-x","volume":"26","author":"P. Godefroid","year":"2005","unstructured":"Godefroid, P.: Software model checking: The VeriSoft approach. Formal Methods in System Design\u00a026(2), 77\u2013101 (2005)","journal-title":"Formal Methods in System Design"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, H., Penczek, W., Valmari, A.: Stuttering-insensitive automata for on-the-fly detection of livelock properties. ENTCS\u00a066(2) (2002)","DOI":"10.1016\/S1571-0661(04)80411-0"},{"key":"6_CR10","unstructured":"Ho, A., Smith, S., Hand, S.: On deadlock, livelock, and forward progress. Technical Report UCAM-CL-TR-633, Cambridge University, Computer Laboratory, p. 8 (2005), http:\/\/www.cl.cam.ac.uk\/TechReports\/UCAM-CL-TR-633.pdf"},{"key":"6_CR11","volume-title":"The SPIN model checker: Primer and reference manual","author":"G.J. Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The SPIN model checker: Primer and reference manual. Addison-Wesley, Reading (2004)"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s100090050045","volume":"2","author":"M. Kamel","year":"2000","unstructured":"Kamel, M., Leue, S.: Formalization and validation of the general Inter-ORB protocol (GIOP) using PROMELA and SPIN. Int. Journal on Software Tools for Technology Transfer (STTT)\u00a02(4), 394\u2013409 (2000)","journal-title":"Int. Journal on Software Tools for Technology Transfer (STTT)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-24732-6_16","volume-title":"Model Checking Software","author":"S. Leue","year":"2004","unstructured":"Leue, S., Mayr, R., Wei, W.: A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol.\u00a02989, pp. 216\u2013233. Springer, Heidelberg (2004)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-24730-2_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Leue","year":"2004","unstructured":"Leue, S., Mayr, R., Wei, W.: A Scalable Incomplete Test for the Boundedness of UML RT Models. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 327\u2013341. Springer, Heidelberg (2004)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11537328_8","volume-title":"Model Checking Software","author":"S. Leue","year":"2005","unstructured":"Leue, S., Wei, W.: Counterexample-Based Refinement for a Boundedness Test for CFSM Languages. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 58\u201374. Springer, Heidelberg (2005)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11691372_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Leue","year":"2006","unstructured":"Leue, S., Wei, W.: A Region Graph Based Approach to Termination Proofs. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 318\u2013333. Springer, Heidelberg (2006)"},{"key":"6_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems \u2013 Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems \u2013 Specification. Springer, Heidelberg (1992)"},{"key":"6_CR18","unstructured":"Nakatani, T.: Verification of group address registration protocol using PROMELA and SPIN. In: Proc. of SPIN (1997), Available at: http:\/\/spinroot.com\/spin\/Workshops\/ws97\/nakatani.pdf"},{"key":"6_CR19","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs (1982)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/32.988494","volume":"28","author":"S.F. Siegel","year":"2002","unstructured":"Siegel, S.F., Avrunin, G.S.: Improving the precision of INCA by eliminating solutions with spurious cycles. IEEE Trans. Software Eng.\u00a028(2), 115\u2013128 (2002)","journal-title":"IEEE Trans. Software Eng."},{"key":"6_CR21","unstructured":"S.L.A.P tool (version 0.1): A static livelock analyzer for CSP processes, Webpage: http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/joel.ouaknine\/software\/slap.html"},{"key":"6_CR22","first-page":"361","volume":"2","author":"G. Bochmann von","year":"1978","unstructured":"von Bochmann, G.: Finite state description of communication protocols. Computer Networks\u00a02, 361\u2013372 (1978)","journal-title":"Computer Networks"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:53Z","timestamp":1605644153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11817949_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}