## Zero-Safe Nets, or Transition Synchronization Made Simple (1997)

Venue: | PROC. OF EXPRESS’97 |

Citations: | 17 - 13 self |

### BibTeX

@INPROCEEDINGS{Bruni97zero-safenets,,

author = {Roberto Bruni and Ugo Montanari},

title = {Zero-Safe Nets, or Transition Synchronization Made Simple},

booktitle = {PROC. OF EXPRESS’97},

year = {1997},

pages = {7},

publisher = {Elsevier Science}

}

### Years of Citing Articles

### OpenURL

### Abstract

In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable transaction, which may use zero places, but which is atomic when seen from stable places: no stable token generated in a transaction can be reused in the same transaction. Every zero-safe net has an ordinary Place-Transition net as its abstract counterpart, where only stable places are maintained, and where every transaction becomes a transition. The two nets allow us to look at the same system from both an abstract and a refined viewpoint. To achieve this result no new interaction mechanism is used, besides the ordinary token-pushing rules of nets. The refined zero-safe nets can be much smaller than their corresponding abstract P/T nets, since they take advantage of a transition synchronization mechanism. For instance, when transactions of unlimited l...

### Citations

350 |
Kommunication mit Automaten
- Petri
- 1962
(Show Context)
Citation Context ...: Petri nets are monoids. Abstraction. Transition synchronization. Transaction. Collective token philosophy. c fl1997 Published by Elsevier Science B. V. Bruni and Montanari 1 Introduction Petri nets =-=[18,17]-=-, are unanimously considered one of the most attractive models of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on ... |

161 |
Petri nets are monoids
- Meseguer, Montanari
- 1990
(Show Context)
Citation Context ...ets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we mention [20,12,3]. We follow the approach initiated in [12] (other references =-=are [13,4,14,15]-=-). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. The basic observation is that a Petri net is just a graph where the set of no... |

130 |
Petri nets
- Reisig
- 1985
(Show Context)
Citation Context ...: Petri nets are monoids. Abstraction. Transition synchronization. Transaction. Collective token philosophy. c fl1997 Published by Elsevier Science B. V. Bruni and Montanari 1 Introduction Petri nets =-=[18,17]-=-, are unanimously considered one of the most attractive models of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on ... |

110 |
The Petri box calculus: a new causal algebra with multi-label communication
- Best, Devillers, et al.
- 1992
(Show Context)
Citation Context ...dels of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on which to interpret concurrent languages (see for instance =-=[19,10,16,5,8,2]-=-). However the basic net model does not ooeer any synchronization mechanism among transitions, while this feature is essential to write modular, expressive programs. Thus all the above translations in... |

99 |
The non-sequential behaviour of Petri nets
- Goltz, Reisig
- 1983
(Show Context)
Citation Context ...own that it is possible to enrich the algebraic structure of transitions in order to capture some basic constructions on netsscase graphs, ��ring sequences, Goltz-Reisig and Best-Devillers process=-=es ([11,1]), etc. -=-In particular, in [13] a chain of adjunctions is de��ned, each adjunction showing a further enrichement of the algebraic structure on transitions. We are mainly interested in the de��nition of... |

77 |
Petri net models for algebraic theories of concurrency
- Glabbeek, Vaandrager
- 1987
(Show Context)
Citation Context ...dels of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on which to interpret concurrent languages (see for instance =-=[19,10,16,5,8,2]-=-). However the basic net model does not ooeer any synchronization mechanism among transitions, while this feature is essential to write modular, expressive programs. Thus all the above translations in... |

76 | Event structure semantics in CCS and related languages
- Winskel
- 1982
(Show Context)
Citation Context ...dels of concurrency. As a matter of fact, this model ooeers a basic concurrent framework that has often been used as a semantic foundation on which to interpret concurrent languages (see for instance =-=[19,10,16,5,8,2]-=-). However the basic net model does not ooeer any synchronization mechanism among transitions, while this feature is essential to write modular, expressive programs. Thus all the above translations in... |

72 |
Petri nets, algebras, morphisms, and compositionality
- Winskel
- 1987
(Show Context)
Citation Context ...g exactly to the construction of the abstract net in Def. 3.9. 4.1 Petri Nets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we ment=-=ion [20,12,3]-=-. We follow the approach initiated in [12] (other references are [13,4,14,15]). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. ... |

65 | The tile model
- Gadducci, Montanari
- 2000
(Show Context)
Citation Context ...ain restrictions we need here (for the arrows of category ZSN) could be possibly lifted in the individual token case. Finally we want to mention a connection between zero-safe nets and the tile model =-=[6,7]-=-. Tiles are rewrite rules, similar to SOS inference rules, equipped with three operations of composition: horizontal, vertical and parallel. Horizontal composition builds tiles corresponding to synchr... |

48 |
A categorical linear framework for Petri nets, in
- Brown, Gum
- 1990
(Show Context)
Citation Context ...g exactly to the construction of the abstract net in Def. 3.9. 4.1 Petri Nets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we ment=-=ion [20,12,3]-=-. We follow the approach initiated in [12] (other references are [13,4,14,15]). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. ... |

40 | Configuration structures
- Glabbeek, Plotkin
- 1995
(Show Context)
Citation Context ... equivalent all the computations where the same concurrent events are executed in dioeerent orders. In the case of P/T nets, the simplest approach is the collective token philosophy (see for instance =-=[9]) which iden-=-ti��es all ��ring sequences obtained by repeatedly permuting pairs of ��rings which are concurrently (i.e. independently) enabled. An alternative approach, the individual token philosophy,... |

39 |
Axiomatizing the algebra of net computations and processes
- Degano, Meseguer, et al.
- 1996
(Show Context)
Citation Context ...ets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we mention [20,12,3]. We follow the approach initiated in [12] (other references =-=are [13,4,14,15]-=-). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. The basic observation is that a Petri net is just a graph where the set of no... |

36 |
A distributed operational semantics for CCS based on condition/event systems
- Degano, Nicola, et al.
- 1988
(Show Context)
Citation Context |

26 | Process versus unfolding semantics for Place/Transition Petri nets. Theoretical Computer Science
- Meseguer, Montanari, et al.
(Show Context)
Citation Context ...ets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we mention [20,12,3]. We follow the approach initiated in [12] (other references =-=are [13,4,14,15]-=-). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. The basic observation is that a Petri net is just a graph where the set of no... |

24 | On the Algebraic Approach to Concurrent Term Rewriting
- Gadducci
- 1996
(Show Context)
Citation Context ...ain restrictions we need here (for the arrows of category ZSN) could be possibly lifted in the individual token case. Finally we want to mention a connection between zero-safe nets and the tile model =-=[6,7]-=-. Tiles are rewrite rules, similar to SOS inference rules, equipped with three operations of composition: horizontal, vertical and parallel. Horizontal composition builds tiles corresponding to synchr... |

21 |
Operational Petri net semantics for CCSP
- Olderog
- 1987
(Show Context)
Citation Context |

17 |
Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory
- Meseguer, Montanari
- 1988
(Show Context)
Citation Context ...g exactly to the construction of the abstract net in Def. 3.9. 4.1 Petri Nets are Monoids Petri net theory can be pro��tably developed within category theory. Among the existing approaches we ment=-=ion [20,12,3]-=-. We follow the approach initiated in [12] (other references are [13,4,14,15]). This approach focuses on the monoidal structure of Petri nets, where the monoidal operation means parallel composition. ... |

13 | U.Montanari: On the Implementation of Concurrent Calculi in Net Calculi: two Case Studies. Theoretical Computer Science 141(1-2
- Gorrieri
- 1995
(Show Context)
Citation Context |

3 |
Representation Theorems for Petri Nets. Festschrift
- Meseguer, Montanari, et al.
- 1998
(Show Context)
Citation Context |