{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:17Z","timestamp":1740099617357,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030369866"},{"type":"electronic","value":"9783030369873"}],"license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-36987-3_10","type":"book-chapter","created":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:34:36Z","timestamp":1577838876000},"page":"165-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Implicitly Quantified Modal Logic over Dynamic Networks of Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4265-5772","authenticated-orcid":false,"given":"Anantha","family":"Padmanabha","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Aiswarya, C., Atig, M.F., Montali, M., Rezine, O.: Recency-bounded verification of dynamic database-driven systems. In: Proceedings of the 35th ACM Symposium on Principles of Database Systems (2016)","DOI":"10.1145\/2902251.2902300"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1093\/logcom\/4.5.811","volume":"4","author":"J Benthem van","year":"1994","unstructured":"van Benthem, J., van Eijck, J., Stebletsova, V.: Modal logic, transition systems and processes. J. Log. Comput. 4(5), 811\u2013855 (1994). \nhttps:\/\/doi.org\/10.1093\/logcom\/4.5.811","journal-title":"J. Log. Comput."},{"key":"10_CR3","volume-title":"Modal Logic (Cambridge Tracts in Theoretical Computer Science)","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic (Cambridge Tracts in Theoretical Computer Science). Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1013842612702","volume":"69","author":"M Fitting","year":"2001","unstructured":"Fitting, M., Thalmann, L., Voronkov, A.: Term-modal logics. Studia Logica 69(1), 133\u2013169 (2001)","journal-title":"Studia Logica"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(95)98593-D","volume":"74","author":"AJ Grove","year":"1995","unstructured":"Grove, A.J.: Naming and identity in epistemic logic Part II: a first-order logic for naming. Artif. Intell. 74(2), 311\u2013350 (1995)","journal-title":"Artif. Intell."},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1093\/logcom\/3.4.345","volume":"3","author":"AJ Grove","year":"1993","unstructured":"Grove, A.J., Halpern, J.Y.: Naming and identity in epistemic logics Part I: the propositional case. J. Log. Comput. 3(4), 345\u2013378 (1993)","journal-title":"J. Log. Comput."},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.4324\/9780203290644","volume-title":"A New Introduction to Modal Logic","author":"M Hughes","year":"1996","unstructured":"Hughes, M., Cresswell, G.: A New Introduction to Modal Logic. Routledge, Abingdon (1996)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-99368-3_39","volume-title":"Rough Sets","author":"MA Khan","year":"2018","unstructured":"Khan, M.A., Patel, V.S.: A formal study of a generalized rough set model based on relative approximations. In: Nguyen, H.S., Ha, Q.-T., Li, T., Przyby\u0142a-Kasperek, M. (eds.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 502\u2013510. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99368-3_39"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L Lamport","year":"1994","unstructured":"Lamport, L.: The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16(3), 872\u2013923 (1994). \nhttps:\/\/doi.org\/10.1145\/177492.177726","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR10","unstructured":"Padmanabha, A., Ramanujam, R.: Model checking a logic over systems with regular sets of processes. Developmental Aspects of Intelligent Adaptive Systems (Innovations in Software Engineering), CEUR Workshop Proceedings, vol. 1819 (2017)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-662-58771-3_2","volume-title":"Logic and Its Applications","author":"A Padmanabha","year":"2019","unstructured":"Padmanabha, A., Ramanujam, R.: Propositional modal logic with implicit modal quantification. In: Khan, M.A., Manuel, A. (eds.) ICLA 2019. LNCS, vol. 11600, pp. 6\u201317. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-662-58771-3_2"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (SFCS 1977), pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"10_CR13","unstructured":"Sipser, M.: Introduction to the Theory of Computation, vol. 2. Thomson Course Technology Boston (2006)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.4204\/EPTCS.251.38","volume":"251","author":"Yanjing Wang","year":"2017","unstructured":"Wang, Y.: A new modal framework for epistemic logic. In: Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2017, Liverpool, UK, 24\u201326 July 2017, pp. 515\u2013534 (2017)","journal-title":"Electronic Proceedings in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36987-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:35:21Z","timestamp":1577838921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36987-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"ISBN":["9783030369866","9783030369873"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36987-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"9 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"110","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there are 6 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}