{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:01:06Z","timestamp":1765123266077},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_35","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"458-472","source":"Crossref","is-referenced-by-count":13,"title":["Defining Fairness"],"prefix":"10.1007","author":[{"given":"Hagen","family":"V\u00f6lzer","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Varacca","sequence":"additional","affiliation":[]},{"given":"Ekkart","family":"Kindler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082, 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. IPL\u00a021, 181\u2013185 (1985)","journal-title":"IPL"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K.R. Apt","year":"1988","unstructured":"Apt, K.R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distributed Computing\u00a02, 226\u2013241 (1988)","journal-title":"Distributed Computing"},{"key":"35_CR4","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":"35_CR5","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: Positional determinacy of infinite games. In: STAGS, pp. 4\u201318 (2004)","DOI":"10.1007\/978-3-540-24749-4_2"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/978-3-642-82453-1_17","volume-title":"Logics and Models of Concurrent Systems","author":"D. Harel","year":"1985","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logics and Models of Concurrent Systems, pp. 477\u2013498. Springer, Heidelberg (1985)"},{"key":"35_CR7","unstructured":"Kindler, E.: Safety and liveness properties: A survey. EATCS Bulletin, vol. 53 (1994)"},{"issue":"7","key":"35_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0950-5849(89)90159-6","volume":"31","author":"M.Z. Kwiatkowska","year":"1989","unstructured":"Kwiatkowska, M.Z.: Survey of fairness notions. Information and Software Technology\u00a031(7), 371\u2013386 (1989)","journal-title":"Information and Software Technology"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z.: On topological characterization of behavioural properties. Topology and Category Theory in Computer Science, Oxford Univ. Press (1991)","DOI":"10.1093\/oso\/9780198537601.003.0006"},{"issue":"2","key":"35_CR10","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 Transactions on Software Engineering\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Systems","author":"L. Lamport","year":"1985","unstructured":"Lamport, L.: Formal foundation for specification and verification. In: Alford, M.W., Hommel, G., Schneider, F.B., Ansart, J.P., Lamport, L., Mullery, G.P., Liskov, B. (eds.) Distributed Systems. LNCS, vol.\u00a0190. Springer, Heidelberg (1985)"},{"issue":"4","key":"35_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/PL00008921","volume":"13","author":"L. Lamport","year":"2000","unstructured":"Lamport, L.: Fairness and hyperfairness. Distr. Computing\u00a013(4), 239\u2013245 (2000)","journal-title":"Distr. Computing"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-10843-2_22","volume-title":"Automata, Languages and Programming","author":"D. Lehmann","year":"1981","unstructured":"Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice, and fairness: The ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 264\u2013277. Springer, Heidelberg (1981)"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/93385.93442","volume-title":"9th PODC","author":"Z. Manna","year":"1990","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: 9th PODC, pp. 377\u2013408. ACM, New York (1990)"},{"key":"35_CR15","volume-title":"Measure and Category. A Survey of the Analogies between Topological and Measure Spaces","author":"J.C. Oxtoby","year":"1971","unstructured":"Oxtoby, J.C.: Measure and Category. A Survey of the Analogies between Topological and Measure Spaces. Springer, Heidelberg (1971)"},{"key":"35_CR16","first-page":"39","volume-title":"4th PODC","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P.: On characterization of safety and liveness properties in temporal logic. In: 4th PODC, pp. 39\u201348. ACM, New York (1985)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"V\u00f6lzer, H., Varacca, D., Kindler, E. : Defining Fairness. SIIM Technical Report SIIM-TR-A-05-18, Universit\u00e4t zu L\u00fcbeck (2005)","DOI":"10.1007\/11539452_35"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T10:07:04Z","timestamp":1706609224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11539452_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}