This text is an excerpt from a scientific book focusing on describing a computer algorithm that verifies parallel coordination programs. The algorithm's goal is to check if each of these programs reaches a compact state, a status where the desired result can be achieved within a finite time frame. The book introduces the concept of controlled vector addition systems (CVAS) as a mathematical model for parallel program analysis and provides an algorithm called DEVELOP to construct reachability set descriptions for a class of CVAS. The algorithm is proven to terminate if the program being tested is normal, and termination is equivalent to compactness in this context. Additionally, the book explores how DEVELOP can be applied to parametric CVAS, a concept that introduces a variable parameter to the algorithm. The author demonstrates that DEVELOP will still terminate for a parametric CVAS if the reachability set is finite for each value of the parameter. These insights provide new tools and techniques for analyzing and verifying the behavior of parallel coordination programs.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Explore how to verify compact parallel programs using a geometric model and a practical algorithm. This book introduces a reachability framework built around controlled vector addition systems (CVAS) and a method called DEVELOP to generate observable representations of reachable states. It shows how the structure of CVAS connects to parallel coordination programs and explains conditions under which the analysis terminates or remains finite.- Learn the core idea of a reachability set description (RSD) and how it describes which states a program can reach.- See how the DEVELOP algorithm builds RSDs for a class of CVAS and why compactness and normality matter.- Understand parametric analysis for families of CVAS and what it means for termination and representative values.- Discover how concepts like restricted, conservative CVAS and regions help manage complexity in verification.Ideal for readers of formal verification, parallel programming, and verification of coordination systems who want a concrete modeling approach and a practical verification method. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332087051_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332087051
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332087051
Quantity: 15 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 26050144/2
Quantity: 1 available