{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:41Z","timestamp":1762458461106},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_36","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"546-561","source":"Crossref","is-referenced-by-count":3,"title":["Using Fairness Constraints in Process-Algebraic Verification"],"prefix":"10.1007","author":[{"given":"Antti","family":"Puhakka","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","first-page":"470","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, p. 470. Addison-Wesley Publishing Company, Reading (1974)"},{"issue":"4","key":"36_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.: Defining Liveness. Information Processing Letters\u00a021(4), 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K. Apt","year":"1988","unstructured":"Apt, K., Francez, N., Katz, S.: Appraising Fairness in Languages for Distributed Programming. Distributed Computing\u00a02(4), 226\u2013241 (1988)","journal-title":"Distributed Computing"},{"issue":"5","key":"36_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K.A. Bartlett","year":"1969","unstructured":"Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A Note on Reliable Full-Duplex Transmission Over Half-Duplex Links. Communications of the ACM\u00a012(5), 260\u2013261 (1969)","journal-title":"Communications of the ACM"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995 Concurrency Theory","author":"E. Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair Testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 313\u2013327. Springer, Heidelberg (1995)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Synthesis of [2] Synchronization Skeletons for Branching Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-44450-5_25","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"R. Cleaveland","year":"2000","unstructured":"Cleaveland, R., L\u00fcttgen, G.: A Semantic Theory for Heterogeneous System Design. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 312\u2013324. Springer, Heidelberg (2000)"},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BF00271640","volume":"21","author":"G. Costa","year":"1984","unstructured":"Costa, G., Stirling, C.: A Fair Calculus of Communicating Systems. Acta Informatica\u00a021(1), 417\u2013441 (1984)","journal-title":"Acta Informatica"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness, p. 295. Springer, Heidelberg (1986)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: Proc. Fifteenth IFIP International Symposium on Protocol Specification, Testing and Verification. IFIP Conference Proceedings 38, pp. 3\u201318 (1995)","DOI":"10.1007\/978-0-387-34892-6_1"},{"issue":"2,3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(87)90004-1","volume":"49","author":"M. Hennessy","year":"1987","unstructured":"Hennessy, M.: An Algebraic Theory of Fair Asynchronous Communicating Processes. Theoretical Computer Science\u00a049(2,3), 121\u2013143 (1987)","journal-title":"Theoretical Computer Science"},{"key":"36_CR12","first-page":"256","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes, p. 256. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0084793","volume-title":"CONCUR \u201992","author":"R. Kaivola","year":"1992","unstructured":"Kaivola, R., Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 207\u2013221. Springer, Heidelberg (1992)"},{"key":"36_CR14","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":"36_CR15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems, Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification, vol.\u00a0I, p. 427. Springer, Heidelberg (1992)"},{"key":"36_CR16","first-page":"260","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency, 260 p. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"2","key":"36_CR17","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1006\/inco.2000.2886","volume":"163","author":"S. Older","year":"2000","unstructured":"Older, S.: Strong Fairness and Full Abstraction for Communicating Processes. Information and Computation\u00a0163(2), 471\u2013509 (2000)","journal-title":"Information and Computation"},{"key":"36_CR18","unstructured":"Parrow, J.: Fairness Properties in Process Algebra with Applications in Communication Protocol Verification. Ph.D. thesis, Uppsala University, 176 p. (1985)"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"Pnueli, A.: A Temporal Logic of Concurrent Programs. Theoretical Computer Science\u00a013, 45\u201360 (1981)","journal-title":"Theoretical Computer Science"},{"key":"36_CR20","unstructured":"Puhakka, A.: Using Fairness in Process-Algebraic Verification. Tampere University of Technology, Institute of Software Systems Report 24 (2003), http:\/\/www.cs.tut.fi\/ohj\/VARG\/publications\/"},{"key":"36_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-44685-0_14","volume-title":"CONCUR 2001 - Concurrency Theory","author":"A. Puhakka","year":"2001","unstructured":"Puhakka, A., Valmari, A.: Liveness and Fairness in Process-Algebraic Verification. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 202\u2013217. Springer, Heidelberg (2001)"},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and Verification of Concurrent Systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"36_CR23","first-page":"565","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency, p. 565. Prentice-Hall, Englewood Cliffs (1998)"},{"issue":"2,3","key":"36_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A..P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The Complementation Problem for B\u00fcchi Automata with Applications to Temporal Logic. Theoretical Computer Science\u00a049(2,3), 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"36_CR25","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"36_CR26","unstructured":"Valmari, A.: A Chaos-Free Failures Divergences Semantics with Applications to Verification. In: Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford\u2013Microsoft Symposium in honour of Sir Tony Hoare. Palgrave \u201dCornerstones of Computing\u201d series, pp. 365\u2013382 (2000)"},{"issue":"4","key":"36_CR27","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211218","volume":"7","author":"A. Valmari","year":"1995","unstructured":"Valmari, A., Tienari, M.: Compositional Failure-Based Semantic Models for Basic LOTOS. Formal Aspects of Computing\u00a07(4), 440\u2013468 (1995)","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T11:08:02Z","timestamp":1586516882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11560647_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}