A behavior is defined by a Petri net or an automaton. In both cases, it is a set
of states/places and transitions. In the case of an automaton the keyword state is followed by a control state and the list of outgoing transitions from this state. Each transition is labelled by a port identifier followed by its guard, function (i.e. statement) and a target state. The target state is either a simple state or a selected list of target states, in this case all list elements must have a condition except the last one which must be unconditional.
In the case of a Petri net, the keyword trans is followed by a port identifier, the
keyword from, the list of incoming places, its guard, function, and the target
places. The target places are either a simple list of places or a selected list of couples (condition, target places) followed by unconditional target places.