eprintid: 304
rev_number: 10
eprint_status: archive
userid: 32
dir: disk0/00/00/03/04
datestamp: 2011-05-27 12:47:58
lastmod: 2011-07-11 14:36:25
status_changed: 2011-05-27 12:47:58
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Gorla, Daniele
creators_name: Pugliese, Rosario
creators_id: r.denicola@imtlucca.it
creators_id: 
creators_id: 
title: Pattern Matching over a Dynamic Network of Tuple Spaces
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: In this paper, we present recent work carried on μ Klaim, a core calculus that retains most of the features of Klaim: explicit process distribution, remote operations, process mobility and asynchronous communication via distributed tuple spaces. Communication in μ Klaim is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the matched variables within the continuation process. Pattern matching is orthogonal to the underlying computational paradigm of μ Klaim, but affects its expressive power. After presenting the basic pattern matching mechanism, inherited from Klaim, we discuss a number of variants that are easy to implement and test, by means of simple examples, the expressive power of the resulting variants of the language.

date: 2005
date_type: published
series: Lecture Notes in Computer Science
volume: 3535
publisher: Springer
pagerange: 1-14
id_number: 10.1007/11494881_1
refereed: TRUE
isbn: 3-540-26181-8
book_title: Formal Methods for Open Object-Based Distributed Systems (FMOODS 2005)
editors_name: Steffen, Martin
editors_name: Zavattaro, Gianluigi
official_url: http://dx.doi.org/10.1007/11494881_1
citation:   De Nicola, Rocco and Gorla, Daniele and Pugliese, Rosario  Pattern Matching over a Dynamic Network of Tuple Spaces.   In:  Formal Methods for Open Object-Based Distributed Systems (FMOODS 2005).   Lecture Notes in Computer Science, 3535 .  Springer, pp. 1-14.  ISBN 3-540-26181-8      (2005)