{"_id":"4361","doi":"10.1007/978-3-642-12032-9_8","title":"Forward analysis of depth-bounded processes","month":"03","oa_version":"Submitted Version","citation":{"ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.","apa":"Wies, T., Zufferey, D., &#38; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108."},"type":"conference","publisher":"Springer","oa":1,"scopus_import":1,"conference":{"end_date":"2010-03-28","location":"Paphos, Cyprus","start_date":"2010-03-20","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"publication_status":"published","file_date_updated":"2020-07-14T12:46:27Z","language":[{"iso":"eng"}],"author":[{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien","first_name":"Damien","orcid":"0000-0002-3197-8736"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"publist_id":"1099","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"94 - 108","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"editor":[{"full_name":"Ong, Luke","first_name":"Luke","last_name":"Ong"}],"date_created":"2018-12-11T12:08:27Z","year":"2010","ddc":["004"],"file":[{"access_level":"open_access","file_id":"4677","creator":"system","checksum":"3e610de84937d821316362658239134a","file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","date_created":"2018-12-12T10:08:17Z","file_size":240766,"date_updated":"2020-07-14T12:46:27Z","content_type":"application/pdf","relation":"main_file"}],"date_published":"2010-03-01T00:00:00Z","has_accepted_license":"1","volume":6014,"pubrep_id":"50","related_material":{"record":[{"status":"public","id":"1405","relation":"dissertation_contains"}]},"intvolume":"      6014","date_updated":"2023-09-07T11:36:36Z","abstract":[{"lang":"eng","text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems."}],"status":"public","day":"01","quality_controlled":"1"}