A symbolic algorithm for the synthesis of bounded Petri nets

This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events are split into several transitions to guarantee the synthesis of a Petri net with bisimilar behavior. The algorithm uses symbolic representations of multisets of states to efficiently generate all the minimal regions. The algorithm has been implemented in a tool. Experimental results show a significant net reduction when compared with approaches for the synthesis of safe Petri nets.Peer ReviewedPostprint (author's final draft

A Comparison of Petri Net Semantics under the Collective Token Philosophy

In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities between three such models, namely configuration structures, concurrent transition systems, and (strictly) symmetric (strict) monoidal categories. We use the notion of adjunction to express each connection. We also present a purely logical description of the collective token interpretation of net behaviours in terms of theories and theory morphisms in partial membership equational logic

Membrane electrode assembly design by use of modelling and cell diagnostics in practical solid polymer fuel cells

SIGLEAvailable from British Library Document Supply Centre-DSC:3816.46616(F/02/00094/REP) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Event Structures for the Collective Tokens Philosophy of Inhibitor Nets

In recent years the collective tokens philosophy for Petri Nets has gained again the stage, but it is commonly set in opposition to the individual tokens philosophy. In this paper we investigate what can be an adequate event structures to capture the collective tokens philosophy of nets when inhibitor arcs are taken into account