登入選單
返回Google圖書搜尋
註釋Abstract: "The I/O automaton model of Lynch and Tuttle is extended to allow modelling of shared memory systems, as well as systems that include both shared memory and shared action communication. A full range of types of atomic accesses to shared memory is allowed, from basic reads and writes to read-modify-write. The extended model supports system description, verification and analysis. As an example, Dijkstra's classical shared memory mutual exclusion algorithm is presented and proved correct."