In: Lectures on Concurrency and Petri Nets: Advances in Petri Nets, pages 686-701. Volume 3098 of Lecture Notes in Computer Science / Jörg Desel, Wolfgang Reisig, Grzegorz Rozenberg (Eds.) --- Springer-Verlag, June 2004.
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.