Step semantics of boolean nets

  1. Lookup NU author(s)
  2. Professor Maciej Koutny
  3. Dr Marta Koutny
Author(s)Kleijn J, Koutny M, Pietkiewicz-Koutny M, Rozenberg G
Publication type Article
JournalActa Informatica
ISSN (print)0001-5903
ISSN (electronic)1432-0525
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Boolean nets are a family of Petri net models with very simple markings which are sets of places. We investigate several classes of boolean nets distinguished by different kinds of individual connections between places and transitions, as well as different ways in which these connections are combined in order to specify the effect of executing steps of transitions. The latter aspect can be captured by connection monoids. A key advantage of using connection monoids is that by describing the step semantics of a class of Petri nets in terms of a connection monoid, one can apply results developed within a general theory of Petri net synthesis. In this paper, we provide an extensive classification of boolean nets which can be described by connection monoids. This classification is based on the realisation that the different ways of interpreting combinations of connections can be made explicit using a higher level monoid. Moreover, we demonstrate that connection monoids can capture other behavioural properties of boolean nets, such as structural conflicts between transitions.
Actions    Link to this publication

Altmetrics provided by Altmetric