Go backward to
Restrictions
Go up to
Top
Go forward to
The Basic Language
Transition Graph
Transition graph
(A|B)
\
c
=
a
.
tau
.
C
C
:=
a
.
b
.
tau
.
C
+
b
.
a
.
tau
.
C
Composite system
Behavior defined without use of composition combinator
|
or restriction combinator!
Internal communication
alpha
.
tau
.
P
=
alpha
.
P
(A|B)
\
c
=
a
.
D
D
:=
a
.
b
.
D
+
b
.
a
.
D
Author:
Wolfgang Schreiner
Last Modification: June 8, 1998
