{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:07:24Z","timestamp":1775246844278,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030024499","type":"print"},{"value":"9783030024505","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02450-5_30","type":"book-chapter","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T08:54:57Z","timestamp":1539161697000},"page":"436-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking Nash-Equilibrium - Automatic Verification of Robustness in Distributed Systems"],"prefix":"10.1007","author":[{"given":"Dileepa","family":"Fernando","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35\u201348. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_3"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1998037.1998055","volume":"42","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Alvisi, L., Halpern, J.Y.: Distributed computing meets game theory: combining insights from two fields. SIGACT News 42(2), 69\u201376 (2011)","journal-title":"SIGACT News"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Aiyer, A., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: Proceedings of 20th ACM Symposium on Operating Systems Principles 2005, pp. 45\u201358 (2005)","DOI":"10.1145\/1095809.1095816"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-642-15497-3_37","volume-title":"Computer Security \u2013 ESORICS 2010","author":"M Backes","year":"2010","unstructured":"Backes, M., Ciobotaru, O., Krohmer, A.: RatFish: a file sharing protocol provably secure against rational users. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 607\u2013625. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15497-3_37"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Clement, A., Li, H.C., Napper, J., Martin, J.P., Alvisi, L., Dahlin, M.: Bar primer. In: International Conference on Dependable Systems and Networks, vol. 8, pp. 287\u2013296. Citeseer (2008)","DOI":"10.1109\/DSN.2008.4630097"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Fernando, D., Dong, N., Jegourel, C., Dong, J.: Verification of Nash-equilibrium for probabilistic bar systems. In: International Conference on Engineering of Complex Computer Systems, pp. 53\u201362. IEEE (2016)","DOI":"10.1109\/ICECCS.2016.016"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Fernando, D., Dong, N., Jegourel, C., Dong, J.: Verification of strong Nash-equilibrium for probabilistic bar systems. In: International Conference on Formal Engineering Methods (2018, to appear)","DOI":"10.1007\/978-3-030-02450-5_7"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Koutsoupias, E., Kyropoulou, M., Tselekounis, Y.: Blockchain mining games. In: Proceedings of 2016 ACM Conference on Economics and Computation, pp. 365\u2013382. ACM (2016)","DOI":"10.1145\/2940716.2940773"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-49674-9_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Kwiatkowska","year":"2016","unstructured":"Kwiatkowska, M., Parker, D., Wiltsche, C.: PRISM-games 2.0: a tool for multi-objective strategy synthesis for stochastic games. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 560\u2013566. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_35"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Leibo, J., Zambaldi, V., Lanctot, M., Marecki, J., Graepel, T.: Multi-agent reinforcement learning in sequential social dilemmas. In: Proceedings of 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 464\u2013473. ACM (2017)","DOI":"10.65109\/QMSU8421"},{"key":"30_CR11","unstructured":"Li, H., et al.: BAR gossip. In: 7th Symposium on Operating Systems Design and Implementation, pp. 191\u2013204 (2006)"},{"key":"30_CR12","unstructured":"Lillibridge, M., Elnikety, S., Birrell, A., Burrows, M., Isard, M.: A cooperative internet backup scheme. In: Proceedings of the General Track: 2003 USENIX Annual Technical Conference, pp. 29\u201341. USENIX (2003)"},{"key":"30_CR13","unstructured":"Mari, F.: Verification and synthesis for discrete time linear hybrid systems. Ph.D. thesis, Universita di Roma (2009)"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00182-010-0244-8","volume":"39","author":"R Shinohara","year":"2010","unstructured":"Shinohara, R.: Coalition-proof equilibria in a voluntary participation game. Int. J. Game Theory 39(4), 603\u2013615 (2010)","journal-title":"Int. J. Game Theory"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Shneidman, J., Parkes, D.C.: Specification faithfulness in networks with rational nodes. In: Proceedings of 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 88\u201397. ACM (2004)","DOI":"10.1145\/1011767.1011781"},{"key":"30_CR16","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. 5643, pp. 709\u2013714. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_59"}],"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-030-02450-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:19:37Z","timestamp":1775243977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02450-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030024499","9783030024505"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02450-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.formal-analysis.com\/icfem\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}