| Class | Description |
|---|---|
| Automata |
Automata : a finite Mealy state machine
is made of
a set of States among which a set of final States and an initial state,
a set of (Mealy)Labels attached to the states,
the transition relation is a set of (outgoing)transitions going from the states and reaching other states.
|
| mAction |
mAction : a mealy Action
it is either "action()" or "var=val"
|
| mCondition |
mCondition : a mealy Condition
it is either "var = val" or "var = var"
the pretty print form is [var=val]
Currently the restriction is var = aDigit
|
| MealyLabel |
MealyLabel : a symbol is used as a label of an FSM's transition.
|
| mEvent |
mEvent : a mealy Event
should be a communication event (toa achieve interaction with the environment)
|
| ProcessBehaviour |
ProcessBehaviour : this application
- builds an adhoc mealy automata,
- parses the list according to the automata
|
| State |
State of a (Mealy) finite state machine:
it has a name, and
a list of outgoing transitions ;
each transition is labelled by a
|
| StateLabelledTransition |
A state labelled transition is: a MealyLabel+ReachedState :
|
| StateSpaceContext | |
| VarIdentifier |
VarIdentifier : a variable is currently a string.
|