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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
Excerpt from An Approach to Automating the Verification of Compact Parallel Coordination Programs II
Abstract - This paper describes an algorithm for building reachability set descriptions for compact parallel programs, introduced in [3]. The notion of a controlled vector addition system (CVAS), which generalises that of a vector addition system, is introduced. An algorithm which exhausts all the reachable states of a CVAS is described, (Motions of compactness and of a normal program are introduced in (3),) It is proved that if the program to which the CVAS corresponds is normal, then termination of this algorithm is equivalent to the compactness of the program.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: 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. Nº de ref. del artículo: 9781332087051_0
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332087051
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332087051
Cantidad disponible: 15 disponibles
Librería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Nº de ref. del artículo: 26050144/2
Cantidad disponible: 1 disponibles