Modeling distributed algorithm using B

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary functionalities of distributed systems. We shall illustrate the use of a certain formal technical for developing distributed algorithms. This technique uses a so-called "event driven" approach together with the B-Method. The resulting general machines for distributed system can serve as a framework for defining new systems or analyzing existing ones. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Zou, S. (2004). Modeling distributed algorithm using B. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3033, 683–689. https://doi.org/10.1007/978-3-540-24680-0_108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free