| 書目名稱 | Decidability of Parameterized Verification | | 編輯 | Roderick Bloem,Ayrat Khalimov,Sasha Rubin | | 視頻video | http://file.papertrans.cn/265/264164/264164.mp4 | | 叢書名稱 | Synthesis Lectures on Distributed Computing Theory | | 圖書封面 |  | | 描述 | While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ????(n) parameterized by n ∈ ?, whether, for all n ∈ ?, the system ????(n) satisfies a specification. In this book we consider the important case of ????(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter. The literature in this area has studied a wealth of computational models based on a variety of synchronization and communication primitives, including token passing, broadcast, and guarded transitions. Often, different terminology is used in the literature, and results are based on implicit assumptions. In this book, we introduce a computational model that unites the central synchronization and communication primitives of many models, and unveils hidden assumption | | 出版日期 | Book 2015 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02011-7 | | isbn_softcover | 978-3-031-00883-2 | | isbn_ebook | 978-3-031-02011-7Series ISSN 2155-1626 Series E-ISSN 2155-1634 | | issn_series | 2155-1626 | | copyright | Springer Nature Switzerland AG 2015 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-7 13:41
發(fā)表于 2025-3-21 17:42:57
