{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:41:59Z","timestamp":1742388119747},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540881933"},{"type":"electronic","value":"9783540881940"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88194-0_4","type":"book-chapter","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T14:56:21Z","timestamp":1224255381000},"page":"5-24","source":"Crossref","is-referenced-by-count":16,"title":["Specifying and Verifying Event-Based Fairness Enhanced Systems"],"prefix":"10.1007","author":[{"given":"Jun","family":"Sun","sequence":"first","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jin Song","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Hai H.","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/945526.945527","volume":"34","author":"K. Alagarsamy","year":"2003","unstructured":"Alagarsamy, K.: Some Myths About Famous Mutual Exclusion Algorithms. SIGACT News\u00a034(3), 94\u2013103 (2003)","journal-title":"SIGACT News"},{"key":"4_CR2","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":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-45694-5_31","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S.D. Brookes","year":"2002","unstructured":"Brookes, S.D.: Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 466\u2013482. Springer, Heidelberg (2002)"},{"unstructured":"Brookes, S.D., Roscoe, A.W., Walker, D.J.: An Operational Semantics for CSP. Technical report (1986)","key":"4_CR4"},{"key":"4_CR5","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.M., 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":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BFb0030305","volume-title":"Mathematical Foundations of Computer Science 1984","author":"G. Costa","year":"1984","unstructured":"Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol.\u00a0176, pp. 245\u2013254. Springer, Heidelberg (1984)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BF01214621","volume":"7","author":"J.F. Costa","year":"1995","unstructured":"Costa, J.F., Sernadas, A.: Progress Assumption in Concurrent Systems. Formal Aspects of Computing\u00a07(1), 18\u201336 (1995)","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W. Damm","year":"2001","unstructured":"Damm, W., Harel, D.: LSCs: Breathing Life into Message Sequence Charts. Formal Methods in System Design\u00a019(1), 45\u201380 (2001)","journal-title":"Formal Methods in System Design"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/11901433_19","volume-title":"Formal Methods and Software Engineering","author":"J.S. Dong","year":"2006","unstructured":"Dong, J.S., Hao, P., Sun, J., Zhang, X.: A Reasoning Method for Timed CSP Based on Constraint Solving. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 342\u2013359. Springer, Heidelberg (2006)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-30482-1_39","volume-title":"Formal Methods and Software Engineering","author":"J. Song Dong","year":"2004","unstructured":"Song Dong, J., Hao, P., Qin, S., Sun, J., Wang, Y.: Timed Patterns: TCOZ to Timed Automata. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 483\u2013498. Springer, Heidelberg (2004)"},{"key":"4_CR11","volume-title":"Model Checking","author":"O. Grumberg","year":"2000","unstructured":"Grumberg, O., Clarke, E.M., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2005.07.004","volume":"345","author":"J. Geldenhuys","year":"2005","unstructured":"Geldenhuys, J., Valmari, A.: More efficient on-the-fly LTL verification with Tarjan\u2019s algorithm. Theoritical Computer Science\u00a0345(1), 60\u201382 (2005)","journal-title":"Theoritical Computer Science"},{"key":"4_CR13","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":"4_CR14","series-title":"Inte. Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Inte. Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)"},{"issue":"5","key":"4_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The Model Checker SPIN. IEEE Transactions on Software Engeering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Transactions on Software Engeering"},{"issue":"1","key":"4_CR16","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 and System Design\u00a028(1), 57\u201384 (2006)","journal-title":"Formal Methods and System Design"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/PL00008921","volume":"13","author":"L. Lamport","year":"2000","unstructured":"Lamport, L.: Fairness and Hyperfairness. Distributed Computing\u00a013(4), 239\u2013245 (2000)","journal-title":"Distributed Computing"},{"issue":"1\u20134","key":"4_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/FI-2000-43123409","volume":"43","author":"T. Latvala","year":"2000","unstructured":"Latvala, T., Heljanko, K.: Coping with Strong Fairness. Fundamenta Informaticae\u00a043(1\u20134), 175\u2013193 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR19","first-page":"919","volume-title":"30th International Conference on Software Engineering (ICSE 2008) Companion Volume","author":"Y. Liu","year":"2008","unstructured":"Liu, Y., Sun, J., Dong, J.S.: An Analyzer for Extended Compositional Process Algebras. In: 30th International Conference on Software Engineering (ICSE 2008) Companion Volume, pp. 919\u2013920. ACM Press, New York (2008)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","volume":"49","author":"E. Nuutila","year":"1994","unstructured":"Nuutila, E., Soisalon-Soininen, E.: On Finding the Strongly Connected Components in a Directed Graph. Information Processing Letters\u00a049(1), 9\u201314 (1994)","journal-title":"Information Processing Letters"},{"issue":"2","key":"4_CR21","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":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0028727","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1998","unstructured":"Peled, D.: Ten Years of Partial Order Reduction. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 17\u201328. Springer, Heidelberg (1998)"},{"key":"4_CR23","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":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-60630-0_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.W. Roscoe","year":"1995","unstructured":"Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical Compression for Model-Checking CSP or How to Check 10 $^{\\mbox{20}}$ Dining Philosophers for Deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019, pp. 133\u2013152. Springer, Heidelberg (1995)"},{"key":"4_CR25","volume-title":"Concurrent and Real-time Systems: the CSP Approach","author":"S. Schneider","year":"2000","unstructured":"Schneider, S.: Concurrent and Real-time Systems: the CSP Approach. John Wiley, Chichester (2000)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-31980-1_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Schwoon","year":"2005","unstructured":"Schwoon, S., Esparza, J.: A Note on On-the-Fly Verification Algorithms. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 174\u2013190. Springer, Heidelberg (2005)"},{"issue":"6","key":"4_CR27","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TSE.2006.55","volume":"32","author":"J. Sun","year":"2006","unstructured":"Sun, J., Dong, J.S.: Design Synthesis from Interaction and State-Based Specifications. IEEE Transactions on Software Engineering\u00a032(6), 349\u2013364 (2006)","journal-title":"IEEE Transactions on Software Engineering"},{"unstructured":"Sun, J., Liu, Y., Dong, J.S., Wang, H.: The Process Analysis Toolset Pat. Technical report, http:\/\/www.comp.nus.edu.sg\/~sunj\/pat.pdf","key":"4_CR28"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88194-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T12:03:52Z","timestamp":1589025832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88194-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540881933","9783540881940"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88194-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}