Summary: Automated Refinement Checking for
Asynchronous Processes
Rajeev Alur, Radu Grosu, and Bow­Yaw Wang
Department of Computer and Information Science
University of Pennsylvania
200 South 33rd Street
Philadelphia, PA 19104
Email: alur,grosu,bywang @ cis.upenn.edu
URL: www.cis.upenn.edu/~alur,grosu,bywang
Abstract. We consider the problem of refinement checking for asyn­
chronous processes where refinement corresponds to stutter­closed lan­
guage inclusion. Since an efficient algorithmic solution to the refinement
check demands the construction of a witness that defines the private
specification variables in terms of the implementation variables, we first
propose a construction to extract a synchronous witness from the specifi­
cation. This automatically reduces individual refinement checks to reach­
ability analysis. Second, to alleviate the state­explosion problem during
search, we propose a reduction scheme that exploits the visibility infor­
mation about transitions in a recursive manner based on the architectural
hierarchy. Third, we establish compositional and assume­guarantee proof

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Wang, Bow-Yaw - Institute of Information Science, Academia Sinica (Taiwan)

Collections: Computer Technologies and Information Sciences