{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:13:27Z","timestamp":1725567207327},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340048"},{"type":"electronic","value":"9783642340055"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34005-5_6","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:33:39Z","timestamp":1349231619000},"page":"99-117","source":"Crossref","is-referenced-by-count":6,"title":["Model Checking LTLR Formulas under Localized Fairness"],"prefix":"10.1007","author":[{"given":"Kyungmin","family":"Bae","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-16310-4_14","volume-title":"Rewriting Logic and Its Applications","author":"K. Bae","year":"2010","unstructured":"Bae, K., Meseguer, J.: The Linear Temporal Logic of Rewriting Maude Model Checker. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol.\u00a06381, pp. 208\u2013225. Springer, Heidelberg (2010)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-22110-1_11","volume-title":"Computer Aided Verification","author":"K. Bae","year":"2011","unstructured":"Bae, K., Meseguer, J.: State\/Event-Based LTL Model Checking under Parametric Generalized Fairness. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 132\u2013148. Springer, Heidelberg (2011)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-24756-2_8","volume-title":"Integrated Formal Methods","author":"S. Chaki","year":"2004","unstructured":"Chaki, S., Clarke, E., Ouaknine, J., Sharygina, N., Sinha, N.: State\/Event-Based Software Model Checking. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol.\u00a02999, pp. 128\u2013147. Springer, Heidelberg (2004)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11537328_15","volume-title":"Model Checking Software","author":"J.-M. Couvreur","year":"2005","unstructured":"Couvreur, J.-M., Duret-Lutz, A., Poitrenaud, D.: On-the-Fly Emptiness Checks for Generalized B\u00fcchi Automata. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 169\u2013184. Springer, Heidelberg (2005)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/244795.244800","volume":"19","author":"D. Dams","year":"1997","unstructured":"Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems\u00a019, 253\u2013291 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-04761-9_17","volume-title":"Automated Technology for Verification and Analysis","author":"A. Duret-Lutz","year":"2009","unstructured":"Duret-Lutz, A., Poitrenaud, D., Couvreur, J.-M.: On-the-fly Emptiness Check of Transition-Based Streett Automata. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 213\u2013227. Springer, Heidelberg (2009)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44829-2_16","volume-title":"Model Checking Software","author":"S. Eker","year":"2003","unstructured":"Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL Model Checker and Its Implementation. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 230\u2013234. Springer, Heidelberg (2003)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-61422-2_117","volume-title":"Algorithm Theory - SWAT \u201996","author":"M.R. Henzinger","year":"1996","unstructured":"Henzinger, M.R., Telle, J.A.: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 16\u201327. Springer, Heidelberg (1996)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Holzmann, G., Peled, D., Yannakakis, M.: On nested depth first search (extended abstract). In: The Spin Verification System, pp. 23\u201332. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/032\/03"},{"key":"6_CR11","unstructured":"Holzmann, G.: The SPIN model checker: Primer and reference manual. Addison Wesley Publishing Company (2004)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10703-006-4342-y","volume":"28","author":"Y. Kesten","year":"2006","unstructured":"Kesten, Y., Pnueli, A., Raviv, L., Shahar, E.: Model checking with strong fairness. Formal Methods in System Design\u00a028(1), 57\u201384 (2006)","journal-title":"Formal Methods in System Design"},{"issue":"11","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/32.60317","volume":"16","author":"J. Kramer","year":"2002","unstructured":"Kramer, J., Magee, J.: The evolving philosophers problem: Dynamic change management. IEEE Transactions on Software Engineering\u00a016(11), 1293\u20131306 (2002)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45740-2_15","volume-title":"Applications and Theory of Petri Nets 2001","author":"T. Latvala","year":"2001","unstructured":"Latvala, T.: Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 242\u2013262. Springer, Heidelberg (2001)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-32033-3_19","volume-title":"Term Rewriting and Applications","author":"J. Meseguer","year":"2005","unstructured":"Meseguer, J.: Localized Fairness: A Rewriting Semantics. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 250\u2013263. Springer, Heidelberg (2005)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-68679-8_22","volume-title":"Concurrency, Graphs and Models","author":"J. Meseguer","year":"2008","unstructured":"Meseguer, J.: The Temporal Logic of Rewriting: A Gentle Introduction. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol.\u00a05065, pp. 354\u2013382. Springer, Heidelberg (2008)"},{"issue":"2-3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.tcs.2008.04.040","volume":"403","author":"J. Meseguer","year":"2008","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational abstractions. Theoretical Computer Science\u00a0403(2-3), 239\u2013264 (2008)","journal-title":"Theoretical Computer Science"},{"key":"6_CR18","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)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-69738-1_10","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M.Y. Vardi","year":"2007","unstructured":"Vardi, M.Y.: Automata-Theoretic Model Checking Revisited. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 137\u2013150. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34005-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:40:41Z","timestamp":1620132041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34005-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340048","9783642340055"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34005-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}