{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:39:35Z","timestamp":1725586775003},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214363"},{"type":"electronic","value":"9783642214370"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21437-0_32","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T07:33:16Z","timestamp":1308382396000},"page":"432-447","source":"Crossref","is-referenced-by-count":2,"title":["On Combining State Space Reductions with Global Fairness Assumptions"],"prefix":"10.1007","author":[{"given":"Shao Jie","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jun","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jin Song","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"http:\/\/www.comp.nus.edu.sg\/"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11795490_10","volume-title":"Principles of Distributed Systems","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing Population Protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 103\u2013117. Springer, Heidelberg (2006)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10722468_1","volume-title":"SPIN Model Checking and Software Verification","author":"D. Bosnacki","year":"2000","unstructured":"Bosnacki, D., Dams, D., Holenderski, L.: Symmetric Spin. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol.\u00a01885, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-24732-6_15","volume-title":"Model Checking Software","author":"D. Bosnacki","year":"2004","unstructured":"Bosnacki, D., Ioustinova, N., Sidorova, N.: Using Fairness to Make Abstractions Work. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol.\u00a02989, pp. 198\u2013215. Springer, Heidelberg (2004)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-44829-2_6","volume-title":"Model Checking Software","author":"D. Bo\u0161na\u010dki","year":"2003","unstructured":"Bo\u0161na\u010dki, D.: A light-weight algorithm for model checking with symmetry reduction and weak fairness. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 89\u2013103. Springer, Heidelberg (2003)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70952-7_6","volume-title":"Formal Methods: Applications and Technology","author":"L. Brim","year":"2007","unstructured":"Brim, L., Cern\u00e1, I., Moravec, P., Simsa, J.: On combining partial order reduction with fairness assumptions. In: Brim, L., Haverkort, B.R., Leucker, M., van de Pol, J. (eds.) FMICS 2006 and PDMC 2006. LNCS, vol.\u00a04346, pp. 84\u201399. Springer, Heidelberg (2007)"},{"key":"32_CR7","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":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-56922-7_37","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting Symmetry In Temporal Logic Model Checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 450\u2013462. Springer, Heidelberg (1993)"},{"key":"32_CR9","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/10722167_8","volume-title":"Computer Aided Verification","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G.: Automatic Verification of Parameterized Cache Coherence Protocols. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 53\u201368. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and Model Checking. Formal Methods in System Design\u00a09(1-2), 105\u2013131 (1996)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/262004.262008","volume":"19","author":"E.A. Emerson","year":"1997","unstructured":"Emerson, E.A., Sistla, A.P.: Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach. ACM Transactions on Programming Languages and Systems\u00a019(4), 617\u2013638 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0035378","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Allen Emerson","year":"1997","unstructured":"Allen Emerson, E., Jha, S., Peled, D.: Combining partial order and symmetry reductions. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 19\u201334. Springer, Heidelberg (1997)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11945529_28","volume-title":"Principles of Distributed Systems","author":"M. Fischer","year":"2006","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 395\u2013409. Springer, Heidelberg (2006)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-63166-6_24","volume-title":"Computer Aided Verification","author":"V. Gyuris","year":"1997","unstructured":"Gyuris, V., Sistla, A.P.: On-the-Fly Model Checking Under Fairness That Exploits Symmetry. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 232\u2013243. Springer, Heidelberg (1997)"},{"key":"32_CR16","unstructured":"Jiang, H.: Distributed Systems of Simple Interacting Agents. PhD thesis, Yale Uni (2007)"},{"issue":"2","key":"32_CR17","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"},{"issue":"4","key":"32_CR18","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"},{"key":"32_CR19","first-page":"81","volume-title":"TASE","author":"Y. Liu","year":"2009","unstructured":"Liu, Y., Pang, J., Sun, J., Zhao, J.H.: Verification of Population Ring Protocols in PAT. In: TASE, pp. 81\u201389. IEEE, Los Alamitos (2009)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/259380.259419","volume-title":"PODC","author":"U. Nitsche","year":"1997","unstructured":"Nitsche, U., Wolper, P.: Relative Liveness and Behavior Abstraction (Extended Abstract). In: PODC, pp. 45\u201352. ACM, New York (1997)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-58179-0_69","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1994","unstructured":"Peled, D.: Combining Partial Order Reductions with On-the-fly Model-Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 377\u2013390. Springer, Heidelberg (1994)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"32_CR23","first-page":"278","volume-title":"STOC","author":"A. Pnueli","year":"1983","unstructured":"Pnueli, A.: On the Extremely Fair Treatment of Probabilistic Algorithms. In: STOC, pp. 278\u2013290. ACM, New York (1983)"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-78163-9_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Pnueli","year":"2008","unstructured":"Pnueli, A., Sa\u2019ar, Y.: All you need is compassion. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 233\u2013247. Springer, Heidelberg (2008)"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-45657-0_9","volume-title":"Computer Aided Verification","author":"A. Pnueli","year":"2002","unstructured":"Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0,1,\u2009\u221e\u2009)-Counter Abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 107\u2013122. Springer, Heidelberg (2002)"},{"issue":"8","key":"32_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/71.406955","volume":"6","author":"F. Pong","year":"1995","unstructured":"Pong, F., Dubois, M.: A New Approach for the Verification of Cache Coherence Protocols. IEEE Transactions on Parallel and Distributed Systems\u00a06(8), 773\u2013787 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"32_CR27","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":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-05089-3_9","volume-title":"FM 2009: Formal Methods","author":"J. Sun","year":"2009","unstructured":"Sun, J., Liu, Y., Roychoudhury, A., Liu, S., Dong, J.S.: Fair model checking with process counter abstraction. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 123\u2013139. Springer, Heidelberg (2009)"},{"key":"32_CR29","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"2","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing\u00a02, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"32_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/stvr.280","volume":"13","author":"U. Ultes-Nitsche","year":"2003","unstructured":"Ultes-Nitsche, U., St James, S.: Improved Verification of Linear-time Properties within Fairness: Weakly Continuation-closed Behaviour Abstractions Computed from Trace Reductions. Software Testing, Verification & Reliability\u00a013(4), 241\u2013255 (2003)","journal-title":"Software Testing, Verification & Reliability"}],"container-title":["Lecture Notes in Computer Science","FM 2011: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21437-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T02:21:26Z","timestamp":1553826086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21437-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214363","9783642214370"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21437-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}