{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:49Z","timestamp":1761597229877},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_19","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"250-263","source":"Crossref","is-referenced-by-count":13,"title":["Localized Fairness: A Rewriting Semantics"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Meseguer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors","author":"G. Agha","year":"1986","unstructured":"Agha, G.: Actors. MIT Press, Cambridge (1986)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-45061-0_22","volume-title":"Automata, Languages and Programming","author":"R. Bruni","year":"2003","unstructured":"Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 252\u2013266. Springer, Heidelberg (2003)"},{"key":"19_CR3","volume-title":"Model Checking","author":"E. Clarke","year":"2001","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2001)"},{"key":"19_CR4","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: Maude 2.0 Manual (June 2003), http:\/\/maude.cs.uiuc.edu"},{"key":"19_CR5","series-title":"ENTCS","volume-title":"Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications","author":"S. Eker","year":"2002","unstructured":"Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gadducci, F., Montanari, U. (eds.) Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, Amsterdam (2002)"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness. Springer, Heidelberg (1986)"},{"key":"19_CR7","unstructured":"Gyuris, V., Sistla, A.: On-the-fly model-checking under fairness that exploits symmetry. Formal Methods in System Design (to appear)"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Lamport, L.: A temporal logic of actions. ACM Trans. on Prog. Lang. and Systems\u00a016(3), 872\u2013923 (1994)","journal-title":"ACM Trans. on Prog. Lang. and Systems"},{"key":"19_CR9","first-page":"1","volume":"34","author":"T. Latvala","year":"2000","unstructured":"Latvala, T., Heljanko, K.: Coping with strong fairness. Fundamenta Informaticae\u00a034, 1\u201319 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR10","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":"19_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"285","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theoretical Computer Science\u00a0285, 121\u2013154 (2002)","journal-title":"Theoretical Computer Science"},{"key":"19_CR12","unstructured":"Meseguer, J.: Localized fairness. Manuscript, UIUC (February 2005), http:\/\/maude.cs.uiuc.edu"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"314","DOI":"10.7551\/mitpress\/2087.003.0017","volume-title":"Research Directions in Concurrent Object-Oriented Programming","author":"J. Meseguer","year":"1993","unstructured":"Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314\u2013390. MIT Press, Cambridge (1993)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"key":"19_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8528-6","volume-title":"A Discipline of Multiprogramming","author":"J. Misra","year":"2001","unstructured":"Misra, J.: A Discipline of Multiprogramming. Springer, Heidelberg (2001)"},{"key":"19_CR17","first-page":"109","volume-title":"Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute","author":"A. Pnueli","year":"2003","unstructured":"Pnueli, A., Kesten, Y.: Algorithmic and deductive verification methods for CTL\u2217. In: Broy, M., Pizka, M. (eds.) Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute, Marktoberdorf, Germany, July 30\u2013 August 11, pp. 109\u2013131. IOS Press, Amsterdam (2003)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-15976-2_14","volume-title":"Rewriting Techniques and Applications","author":"S. Porat","year":"1985","unstructured":"Porat, S., Francez, N.: Fairness in term rewriting systems. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol.\u00a0202, pp. 287\u2013300. Springer, Heidelberg (1985)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-16780-3_77","volume-title":"8th International Conference on Automated Deduction","author":"S. Porat","year":"1986","unstructured":"Porat, S., Francez, N.: Full communication and fair termination in equational (and combined) term-rewriting systems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 21\u201341. Springer, Heidelberg (1986)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-51081-8_126","volume-title":"Rewriting Techniques and Applications","author":"S. Tison","year":"1989","unstructured":"Tison, S.: Fair termination is decidable for ground systems. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 462\u2013476. Springer, Heidelberg (1989)"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(01)00366-8","volume":"285","author":"P. Viry","year":"2002","unstructured":"Viry, P.: Equational rules for rewriting logic. Theoretical Computer Science\u00a0285, 487\u2013517 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T20:09:43Z","timestamp":1711829383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}