Roberto Bruni, Ugo Montanari  Home/Search
Context Related
| di.unipi.it/~bruni...concoord2001.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~bruni...ListOfPapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Zero-safe nets are a variation of Petri nets, where transactions can be suitably modeled. The idea is to distinguish between stable places (whose markings define observable states) and zero-safe places (where tokens can only be temporarily allocated, defining hidden states): Transactions must start and end in observable states. We propose an extension of the coordination language Linda, called TraLinda, where a few basic primitives for expressing transactions are introduced by means of... (Update)
Similar documents based on text: More All
0.2: Zero-Safe Nets: Composing Nets via Transition Synchronization - Bruni, Montanari (1999) (Correct)
0.2: An Example Paper - Name (Correct)
0.2: Zero-Safe Nets, or Transition Synchronization Made Simple - Bruni, Montanari (1997) (Correct)
BibTeX entry: (Update)
R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda. In U. Montanari and V. Sassone, editors, Proc. Int. Workshop on Concurrency and Coordination (ConCoord 2001), volume 54 of Electronic Notes in Theoretical Computer Science, 2001. http://citeseer.ist.psu.edu/bruni01zerosafe.html More
@misc{ bruni01zerosafe,
author = "R. Bruni and U. Montanari",
title = "Zero-safe net models for transactions in Linda",
text = "R. Bruni and U. Montanari. Zero-safe net models for transactions in Linda.
In U. Montanari and V. Sassone, editors, Proc. Int. Workshop on Concurrency
and Coordination (ConCoord 2001), volume 54 of Electronic Notes in Theoretical
Computer Science, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/bruni01zerosafe.html" }
Citations (may not include all citations):375 ACM Transactions on Programming Languages and Systems (context) - Gelernter, in - 1985
291 A calculus of mobile agents - Fournet, Gonthier et al. - 1996
31 Zero-safe nets: Comparing the collective and individual toke.. - Bruni, Montanari - 2000
20 or transition synchronization made simple (context) - Bruni, Montanari - 1997
13 JavaSpaces TM specifications (context) - Microsystem - 2000
13 Zero-safe nets: The individual token approach - Bruni, Montanari - 1998
13 the expressiveness of Linda coordination primitives - Busi, Gorrieri et al. - 2000
10 Comparing three semantics for Linda-like languages - Busi, Gorrieri et al. - 2000
10 Process calculi for coordination: from Linda to JavaSpaces - Busi, Zavattaro - 2000
8 the serializability of transactions in JavaSpaces (context) - Busi, Gorrieri et al. - 2001
7 Algebraic models for contextual nets - Bruni, Sassone - 2000
6 A truly concurrent view of Linda interprocess communication - Busi, Gorrieri et al. - 1996
6 Executing transactions in zero-safe nets - Bruni, Montanari - 2000
5 Petri Nets with Inhibitor and Read Arcs: Semantics (context) - Busi - 1998
5 High-level Petri nets as type theories in the Join calculus - Buscemi, Sassone - 2030
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.di.unipi.it/~bruni/publications/ListOfPapers.html): More
Executable Tile Specifications for Process Calculi - Bruni, Meseguer, Montanari (1999) (Correct)
Tile Logic for Synchronized Rewriting of Concurrent Systems - Bruni (1999) (Correct)
Process and Term Tile Logic - Bruni, Meseguer, Monzanari (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC