Excerpt from An Approach to Automating the Verification of Compact Parallel Coordination Programs II
The notion of compactness and of a normal program are introduced in we remind the reader that compactness means the following: for a given set of initial states of the program, there exists a time bound T independent of the number of executing processing elements such that.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Shipping:
US$ 49.70
From Germany to U.S.A.
Shipping:
FREE
From United Kingdom to U.S.A.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. 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. 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
Quantity: 15 available
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 - Gepflegter, sauberer Zustand. | Seiten: 68 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 26050144/2
Quantity: 1 available