Bigraphs for Petri Nets

Robin Milner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationLectures on Concurrency and Petri Nets
PublisherSpringer Berlin Heidelberg
Pages686-701
Number of pages16
Volume3098
ISBN (Electronic)978-3-540-27755-2
ISBN (Print)978-3-540-22261-3
DOIs
Publication statusPublished - 2003

Fingerprint

Dive into the research topics of 'Bigraphs for Petri Nets'. Together they form a unique fingerprint.

Cite this