Abstract
A simple example is given of the use of bigraphical reactive systems (BRSs). It provides a behavioural semantics for condition-event Petri nets whose interfaces are named condition nodes, using a simple form of BRS equipped with a labelled transition system and its associated bisimilarity equivalence. Both of the latter are derived from the standard net firing rules by a uniform technique in bigraphs, which also ensures that the bisimilarity is a congruence. Furthermore, this bisimilarity is shown to coincide with one induced by a natural notion of experiment on condition-event nets, defined independently of bigraphs.
The paper is intended as a bridge between Petri net theory and bigraphs, as well as a pedagogical exercise in the latter.
The paper is intended as a bridge between Petri net theory and bigraphs, as well as a pedagogical exercise in the latter.
| Original language | English |
|---|---|
| Title of host publication | Lectures on Concurrency and Petri Nets |
| Publisher | Springer |
| Pages | 686-701 |
| Number of pages | 16 |
| Volume | 3098 |
| ISBN (Electronic) | 978-3-540-27755-2 |
| ISBN (Print) | 978-3-540-22261-3 |
| DOIs | |
| Publication status | Published - 2003 |
Fingerprint
Dive into the research topics of 'Bigraphs for Petri Nets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver