The Distributed Interval Geometric Machine Model

This paper presents a distributed version of the Interval Geometric Machine Model, called Distributed Interval Geometric Machine, whose inductive construction allows recursive definitions for interval algorithms involving possibly infinite distributed and synchronous parallel computations performed over array structures. In addition, the programming language $\cal{L}(\mathbb{D}_{\infty})$ is extended to model the semantics of sample distributed algorithms applied to Interval Mathematics.

[1]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[2]  Eric Allender.  NL-printable sets and Nondeterministic Kolmogorov Complexity , 2003, Electron. Notes Theor. Comput. Sci..

[3]  Graçaliz Pereira Dimuro,et al.  A Coherence Space of Rational Intervals for a Construction of IR , 2000, Reliab. Comput..

[4]  Dana S. Scott,et al.  The lattice of flow diagrams , 1971, Symposium on Semantics of Algorithmic Languages.

[5]  Renata Reiser,et al.  First Steps in the Construction of the Geometric Machine Model , 2002 .

[6]  Graçaliz Pereira Dimuro,et al.  A Programming Language for the Interval Geometric Machine , 2003, Electron. Notes Theor. Comput. Sci..

[7]  Robert Roth Stoll,et al.  Set theory and logic , 1963 .

[8]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[9]  Graçaliz Pereira Dimuro,et al.  The Interval Geometric Machine Model , 2004, Numerical Algorithms.

[10]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..