{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:08:46Z","timestamp":1762459726104,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030167219"},{"type":"electronic","value":"9783030167226"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16722-6_5","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:01:08Z","timestamp":1554343268000},"page":"79-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Hybrid Dynamic Logic for Event\/Data-Based Systems"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Hennicker","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Madeira","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Knapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"5_CR1","volume-title":"Modeling in Event-B: System and Software Engineering","author":"JR Abrial","year":"2013","unstructured":"Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press, Cambridge (2013)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Tjoa, A.M., Gruhn, V. (eds.) Proceedings 8th European Software Engineering Conference & 9th ACM SIGSOFT International Symposium Foundations of Software Engineering, pp. 109\u2013120. ACM (2001)","DOI":"10.1145\/503225.503226"},{"issue":"28","key":"5_CR3","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1016\/j.tcs.2011.04.007","volume":"412","author":"SS Bauer","year":"2011","unstructured":"Bauer, S.S., Hennicker, R., Wirsing, M.: Interface theories for concurrency and data. Theoret. Comput. Sci. 412(28), 3101\u20133121 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-79707-4_11","volume-title":"Formal Methods for Industrial Critical Systems","author":"MH Beek ter","year":"2008","unstructured":"ter Beek, M.H., Fantechi, A., Gnesi, S., Mazzanti, F.: An action\/state-based model-checking approach for the analysis of communication protocols for service-oriented applications. In: Leue, S., Merino, P. (eds.) FMICS 2007. LNCS, vol. 4916, pp. 133\u2013148. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-79707-4_11"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bohrer, B., Platzer, A.: A hybrid, dynamic logic for hybrid-dynamic information flow. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 115\u2013124. ACM (2018)","DOI":"10.1145\/3209108.3209151"},{"key":"5_CR6","series-title":"Applied Logic Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0002-4","volume-title":"Hybrid Logic and its Proof-Theory","author":"T Bra\u00fcner","year":"2010","unstructured":"Bra\u00fcner, T.: Hybrid Logic and its Proof-Theory. Applied Logic Series. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-94-007-0002-4"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-72044-9_8","volume-title":"Recent Trends in Algebraic Development Techniques","author":"M Farrell","year":"2017","unstructured":"Farrell, M., Monahan, R., Power, J.F.: An institution for Event-B. In: James, P., Roggenbach, M. (eds.) WADT 2016. LNCS, vol. 10644, pp. 104\u2013119. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-72044-9_8"},{"key":"5_CR8","first-page":"1047","volume-title":"Handbook of Process Algebra","author":"R Gorrieri","year":"2000","unstructured":"Gorrieri, R., Rensink, A.: Action refinement. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 1047\u20131147. Elsevier, Amsterdam (2000)"},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9946.001.0001","volume-title":"Modeling and Analysis of Communicating Systems","author":"JF Groote","year":"2014","unstructured":"Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press, Cambridge (2014)"},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"5_CR11","unstructured":"Hennicker, R., Madeira, A., Knapp, A.: A hybrid dynamic logic for event\/data-based systems (2019). \n                      https:\/\/arxiv.org\/abs\/1902.03074"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46675-9_1","volume-title":"Fundamental Approaches to Software Engineering","author":"A Knapp","year":"2015","unstructured":"Knapp, A., Mossakowski, T., Roggenbach, M., Glauer, M.: An institution for simple UML state machines. In: Egyed, A., Schaefer, I. (eds.) FASE 2015. LNCS, vol. 9033, pp. 3\u201318. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46675-9_1"},{"key":"5_CR13","volume-title":"Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers","author":"L Lamport","year":"2003","unstructured":"Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, Boston (2003)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-45187-7_12","volume-title":"CONCUR 2003 - Concurrency Theory","author":"NA Lynch","year":"2003","unstructured":"Lynch, N.A.: Input\/output automata: basic, timed, hybrid, probabilistic, dynamic, \n                      \n                        \n                      \n                      $$\\ldots $$\n                    . In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 191\u2013192. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45187-7_12"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2018.03.004","volume":"744","author":"A Madeira","year":"2018","unstructured":"Madeira, A., Barbosa, L.S., Hennicker, R., Martins, M.A.: A logic for the stepwise development of reactive systems. Theoret. Comput. Sci. 744, 78\u201396 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR16","unstructured":"Object Management Group: Unified Modeling Language 2.5. Standard formal\/2015-03-01, OMG (2015)"},{"issue":"12","key":"5_CR17","first-page":"1741","volume":"12","author":"P Poizat","year":"2006","unstructured":"Poizat, P., Royer, J.C.: A formal architectural description language based on symbolic transition systems and modal logic. J. Univ. Comp. Sci. 12(12), 1741\u20131782 (2006)","journal-title":"J. Univ. Comp. Sci."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00283329","volume":"25","author":"D Sannella","year":"1988","unstructured":"Sannella, D., Tarlecki, A.: Toward formal development of programs from algebraic specifications: implementations revisited. Acta Inf. 25(3), 233\u2013281 (1988)","journal-title":"Acta Inf."},{"key":"5_CR19","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17336-3","volume-title":"Foundations of Algebraic Specification and Formal Software Development","author":"D Sannella","year":"2012","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-17336-3"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16722-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:07:39Z","timestamp":1558343259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16722-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167219","9783030167226"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16722-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","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":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - 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":"7","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"}}]}}