{"publist_id":"3253","doi":"10.1007/978-3-642-23217-6_27","file":[{"content_type":"application/pdf","file_size":337125,"date_created":"2020-05-19T16:17:48Z","relation":"main_file","file_id":"7870","access_level":"open_access","file_name":"2011_CONCUR_Fisher.pdf","creator":"dernst","checksum":"6bf2453d8e52e979ddb58d17325bad26","date_updated":"2020-07-14T12:46:10Z"}],"page":"404 - 418","conference":{"start_date":"2011-09-06","location":"Aachen, Germany","name":"CONCUR: Concurrency Theory","end_date":"2011-09-09"},"date_updated":"2021-01-12T07:42:57Z","_id":"3362","day":"01","volume":6901,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2011","oa":1,"language":[{"iso":"eng"}],"publication_status":"published","citation":{"ista":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.","ama":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>","short":"J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.","chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>.","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &#38; Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>","mla":"Fisher, Jasmin, et al. <i>Dynamic Reactive Modules</i>. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>.","ieee":"J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418."},"intvolume":"      6901","author":[{"first_name":"Jasmin","last_name":"Fisher","full_name":"Fisher, Jasmin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"},{"last_name":"Singh","full_name":"Singh, Anmol","first_name":"Anmol"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}],"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"scopus_import":1,"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"abstract":[{"text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables.","lang":"eng"}],"month":"01","type":"conference","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","date_published":"2011-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-11T12:02:54Z","oa_version":"Submitted Version","title":"Dynamic reactive modules","ec_funded":1,"status":"public","ddc":["000"]}