PNML grammar, version 2009
The earliest (non standardized) version of PNML was 1.3.2. It does not support the now required concept of Page in PNML models. It does not support the family of High-level Petri Nets ( Symmetric Nets and High-level Petri Net Graphs).
Version 2009 is the current active version of PNML grammar. You may download the entire grammar in one archive.
It defines the following concepts:
- The definition of PNML Core Model.
- Labels used by PT Nets nodes and arcs.
- The any element construct used to define any grammar the standard does not provide precise definition for; for instance, tool specific definition.
- PT Nets type declaration.
- Finite enumerations
- Cyclic enumerations
- Finite integer ranges
- Arbitrary declarations
- High-level Core Structure
- High-level Place/Transition Nets: they are defined as a restriction of High-level Petri Nets Graphs
- Symmetric Nets
- High-Level Nets
You will find below Petri nets models which are stored in PNML Documents of the latest PNML version:
- Place/Transition philosophers model.
- Place/Transition swimming pool model.
- Place/Transition token ring model.
- Symmetric net simple file access model.
- Symmetric net shared memory model.
- High-level Petri net shared memory model.
It is possible to extend PNML schema in any way suitable to your specific need. However, as we said on the presentation page, your new defined type will not yet be standard-compatible. This situation will last until part 3 of the standard defines a coherent theoretical and practical framework to do so, in order for standard-compliant tools to automatically discover and read without any ambiguities, Petri net models according to your new type.
As an example, we publish here Jan Martijn's definition of three new P/T net types:
These PNTDs use a convention document, declaring the special arcs needed for their definition.