Place/transition Petri Nets

Language representability of finite place/transition Petri nets

“…We recall some basic notions on finite P/T Petri nets (see, e.g., [7,[30][31][32] for an introduction). We use here a non-standard notation that better suits our needs.…”

“…In the classic definition of Petri nets (see, e.g., [7,30,31]), the transition labeling is given with actions taken from a set A of unstructured actions; hence, our assumption that A ⊆ L ∪ {τ } is in analogy with this tradition. However, if we want to be more generous and consider Petri nets labeled over the set Act = L ∪ L ∪ {τ } of structured actions and co-actions, the extension of the representability theorem to this larger class of nets is not trivial.…”

Petri Nets to B-Language Transformation in Software Development

“…Petri nets (PN) [8] are a formal language able to naturally express behaviour of non-deterministic, parallel and concurrent systems. PN offer an easy to understand graphical notation and analytical methods, which, for example, allows one to derive invariant properties from the structure of the net.…”

Specification and Validation of an Edge Router Discovery Protocol for Mobile Ad Hoc Networks

“…In addition, state space methods have the advantage that counter examples (error-traces) can be automatically synthesised if the protocol does not satisfy a given property. Other examples of verification techniques for Petri nets [25,10] includes structural and invariant methods [8,26], and partial-order and unfolding methods [9,13].…”

“…Petri nets [25,10] provide the foundation of the graphical notation and the semantical foundation for modelling concurrency, synchronisation, and communication in systems. The functional programming language Standard ML [27] provides the primitives for compactly modelling the sequential aspects of systems (such as data manipulation) and for creating compact and parameterisable models.…”