state (Z.100)

Concrete graphical grammar

<state area> ::=

<state symbol> contains <state list> is associated with
{ <input association area>
| <priority input association area>
| <continuous signal association area>
| <spontaneous transition association area>
| <save association area>}*

<state symbol> ::=

<state list> ::=
{<state name> { , <state name> }*}
| < asterisk state list >

<input association area> ::=
<solid association symbol> is connected to < input area >

<save association area> ::=
<solid association symbol> is connected to <save area>

<spontaneous transition association area> ::=
<solid association symbol>is connected to
<spontaneous transition area>

Semantics

A state represents a particular condition in which a process may consume a signal instance resulting in a transition. If the state has neither spontaneous transitions nor continuous signals, and there are no signal instances in the input port, otherwise than those mentioned in a save, then the process waits in the state until a signal instance is received.

At any time in a state, which contains Spontaneous-transitions, the process may enter into the Transition of one of the Spontaneous-transitions.

Model

When the <state list> of a certain <state> contains more than one <state name>, a copy of the <state> is created for each such <state name>. Then the <state> is replaced by these copies.