| 書(shū)目名稱(chēng) | Verifying Temporal Properties of Systems | | 編輯 | Julian Charles Bradfield | | 視頻video | http://file.papertrans.cn/982/981759/981759.mp4 | | 叢書(shū)名稱(chēng) | Progress in Theoretical Computer Science | | 圖書(shū)封面 |  | | 描述 | This monograph aims to provide a powerful general-purpose proof tech- nique for the verification of systems, whether finite or infinite. It extends the idea of finite local model-checking, which was introduced by Stirling and Walker: rather than traversing the entire state space of a model, as is done for model-checking in the sense of Emerson, Clarke et ai. (checking whether a (finite) model satisfies a formula), local model-checking asks whether a particular state satisfies a formula, and only explores the nearby states far enough to answer that question. The technique used was a tableau method, constructing a tableau according to the formula and the local structure of the model. This tableau technique is here generalized to the infinite case by considering sets of states, rather than single states; because the logic used, the propositional modal mu-calculus, separates simple modal and boolean connectives from powerful fix-point operators (which make the logic more expressive than many other temporal logics), it is possible to give a rela- tively straightforward set of rules for constructing a tableau. Much of the subtlety is removed from the tableau itself, and put into a relati | | 出版日期 | Book 1992 | | 關(guān)鍵詞 | Finite; Invariant; calculus; logic; petri net; proof; verification | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4684-6819-9 | | isbn_softcover | 978-1-4684-6821-2 | | isbn_ebook | 978-1-4684-6819-9 | | copyright | Julian Charles Bradfield 1992 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-8 10:48
發(fā)表于 2025-3-21 17:37:03
