0
Your cart

Your cart is empty

Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology

Not currently available

Decidability of Parameterized Verification (Paperback) Loot Price: R1,348
Discovery Miles 13 480
Decidability of Parameterized Verification (Paperback): Roderick Bloem, Swen Jacobs, Ayrat Kalimov, Igor Konnov

Decidability of Parameterized Verification (Paperback)

Roderick Bloem, Swen Jacobs, Ayrat Kalimov, Igor Konnov

Series: Synthesis Lectures on Distributed Computing Theory

 (sign in to rate)
Loot Price R1,348 Discovery Miles 13 480 | Repayment Terms: R126 pm x 12*

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

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 assumptions from the literature. We survey existing decidability and undecidability results, and give a systematic view of the basic problems in this exciting research area.

General

Imprint: Springer International Publishing AG
Country of origin: Switzerland
Series: Synthesis Lectures on Distributed Computing Theory
Release date: September 2015
First published: 2015
Authors: Roderick Bloem • Swen Jacobs • Ayrat Kalimov • Igor Konnov
Dimensions: 235 x 191mm (L x W)
Format: Paperback
Pages: 158
ISBN-13: 978-3-03-100883-2
Languages: English
Subtitles: English
Categories: Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
LSN: 3-03-100883-9
Barcode: 9783031008832

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners