(Enter summary)
Abstract: Besides transitions and ordinary places (here called stable places), ZS
nets include a set of zero places. These are idealized resources that remain invisible
to external observers, while stable markings, which just consist of tokens
in stable places, de
ne the observable states of the system. The idea is that
any evolution step of a ZS net starts at some stable marking, evolves through
hidden states (i.e., markings with some tokens in zero places) and terminates
into a stable marking.... (Update)
Similar documents based on text: More All
0.6: Zero-Safe Nets: Composing Nets via Transition Synchronization - Bruni, Montanari (1999)
(Correct)
0.4: Executing Transactions in Zero-Safe Nets - Bruni, Montanari (2000)
(Correct)
0.4: Transactions and Zero-Safe Nets - Bruni, Montanari (2001)
(Correct)
BibTeX entry: (Update)
R. Bruni and U. Montanari. Zero-safe nets: Modeling transactions via transition synchronization (abstract). Technical Report CS- http://citeseer.ist.psu.edu/bruni00zerosafe.html More
@article{ bruni00zerosafe,
author = "Roberto Bruni and Ugo Montanari",
title = "Zero-Safe Nets: Comparing the Collective and Individual Token Approaches",
journal = "Information and Computation",
volume = "156",
number = "1-2",
pages = "46-89",
year = "2000",
url = "citeseer.ist.psu.edu/bruni00zerosafe.html" }
Citations (may not include all citations):
31
Zero-safe nets: Comparing the collective and individual toke..
- Bruni, Montanari - 1999
29
Tile Logic for Synchronized Rewriting of Concurrent Systems
- Bruni - 1999
25
EACTS Monographs on Theoretical Computer Science (context) - Reisig, An - 1985
20
or transition synchronization made simple (context) - Bruni, Montanari - 1997
13
Zero-safe nets: The individual token approach
- Bruni, Montanari - 1998
5
Zero-safe nets: Composing nets via transition synchronizatio..
- Bruni, Montanari - 1999
5
A method for stepwise re nement and abstraction of Petri net.. (context) - Suzuki, Murata - 1983
5
Re nement of actions and equivalence notions for concurrent .. (context) - van Glabbeek, Goltz - 1998
4
Behaviour preserving re nements of Petri nets (context) - Vogler - 1987
4
Analysis of Petri nets by stepwise re nement (context) - Valette - 1979
3
General re nement and recursion for the Petri Box calculus (context) - Best, Devillers et al. - 1993
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