PN Example:

Two adjacent rooms in a building are connected by a door. Room B is initially

empty, while there are three desks and four chairs in room A. Two people, initially
also in room A, are required to carry all desks and chairs from room A to room B.
While a desk can only be moved by two people, one person is sufficient to carry a
chair. To describe this process, we define three events: “a desk is moved from room
A to room B”, “a chair is moved from room A to room B”, and “a person walks back
from room B to room A”. Furthermore, we need to keep
track of the number of desks, chairs and people in each room. To do this, we
introduce six counters. Counters and events are connected as shown as in Fig. 2.1.
The figure is to be interpreted
Petri Net Classes

1. Binary Petri nets.

A Petri net is called binary or ordinary if all its weights are 1s, i.e.,
2. Petri net state machines.
A Petri net state machine is a binary Petri
net such that each transition has
exactly one input place (pre-place) and
exactly one output place (postplace).
Given formally:
∀t ∈T : • t = t • = 1
3. Marked graphs.
A binary Petri net is called a marked
graph or event graph if each place
has
exactly one pre-transition and
exactly one post-transition.
Formally,
∀p ∈ P : • p = p • = 1
(7.43)
Figure 7.13 is an example of a
marked graph.
Free-choice nets.
A free-choice net is a binary Petri net such that every arc going out of a
place is either (a) unique arc incoming into a transition and no other arcs go
out of the place or (b) there are more arcs, but each of them is unique arc
going into the transition. Figure 7.15 shows elementary structures
characterizing the free-choice sub-class. Formal description of the subclass
İs ∀p∈ P : p • ≤ 1 or • (p •) = {p}
where (p •) are all post-transitions of place p, and • (p •) means the set of
pre-places of all transitions of the set (p •).
5. Safe Petri nets.
A Petri net is safe if for all markings reachable from M0 :

∀𝑝 ∈ 𝑃, 𝑀(𝑝𝑖) ≤ 1