Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

BLP00 (In proceedings)
Author(s) Lorenzo Bettini, Michele Loreti and Rosario Pugliese
Title« Structured Nets in Klaim »
InProc. of ACM SAC'2000, Special Track on Coordination Models, Languages and Applications
Volume1
Page(s)174-180
Year2000
PublisherACM Press
URLhttp://music.dsi.unifi.it/papers/strucnets.ps.gz
Abstract
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental kernel language to model and program distributed concurrent applications with mobile code. The language consists of a core Linda with multiple tuple spaces distributed over the nodes of a net and of a set of operators for building processes that communicate via tuple spaces. The model underlying Klaim is flat, namely nodes cannot enclose other nodes. This is not realistic if one aims at modeling the Internet architecture; when considering intranets and firewalls, it has a definitely hierarchical structure. In this paper we enrich the Klaim model by introducing a routing function and a partial ordering relation over nodes to obtain a hierarchical model. We also extend the language with a new process operation for programming and implementing system calls that provide access to and permit modification of the structure of a net.

BibTeX code

@inproceedings{BLP00,
  volume = {1},
  author = {Bettini, Lorenzo and Loreti, Michele and Pugliese, Rosario},
  booktitle = {Proc. of ACM SAC'2000, Special Track on Coordination Models,
               Languages and Applications},
  url = {http://music.dsi.unifi.it/papers/strucnets.ps.gz},
  title = {{Structured Nets in Klaim}},
  abstract = {Klaim (Kernel Language for Agents Interaction and Mobility) is an
              experimental kernel language to model and program distributed
              concurrent applications with mobile code. The language consists of
              a core Linda with multiple tuple spaces distributed over the nodes
              of a net and of a set of operators for building processes that
              communicate via tuple spaces. The model underlying Klaim is flat,
              namely nodes cannot enclose other nodes. This is not realistic if
              one aims at modeling the Internet architecture; when considering
              intranets and firewalls, it has a definitely hierarchical
              structure. In this paper we enrich the Klaim model by introducing
              a routing function and a partial ordering relation over nodes to
              obtain a hierarchical model. We also extend the language with a
              new process operation for programming and implementing system
              calls that provide access to and permit modification of the
              structure of a net. },
  publisher = {ACM Press},
  pages = {174-180},
  year = {2000},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!