The resulting conflict may be resolved in a purely

A$.$ deterministic

way.

C$.$ concurrent.

B$.$ non$-$deterministic $.$

D$.$ synchronization.

means that the transitions $t_1$ and $t_2$ are both ready to fire but the

firing of any leads to the disabling of the other transitions.

A$.$ Conflict

B$.$ Concurrency.

C$.$ Synchronization.

D$.$ Sequential Execution.

A

may have zero or more tokens.

A$.$ transition

B$.$ place.

C$.$ arc.

D$.$ none of the above $.$

means that transition $t_2$ can fire only after the firing of $t_1.$ This impose

the precedence of constraints $"t_2$ after $t_1.".$

A$.$ Conflict

B$.$ Concurrency.

C$.$ Synchronization.

D$.$ Sequential Execution.

means that the transition $t_1$ will be enabled only when a token there

are at least one token at each of its input places.

A$.$ Con:lict

C$.$ Synchronization.

B$.$ Concurrency.

D$.$ Sequential Execution.

A marked graph consists of:

A$.$ nodes $($actors$)$

C$.$ number of tokens on edges

B$.$ edges $.$

D$.$ All the Above.