Transition System Compiler
Next: The Toolset
Up: The TOPO Tool
Previous: ADT Compiler
-
An automata is generated that behaves according to the specification. Only
the transitions allowed by the specification may happen.
-
Random (fair) behaviour is implemented for non-deterministic
specifications.
-
Side-effects may be specified as pieces of code written in a programming
language. The program fragment is associated to action offers. The code is
executed upon synchronisation success. It is similar to output actions in
automata.
-
Event offers may be delayed for some time (in seconds).
-
Event offers may depend on external conditions: active wait is provided on
user specified predicates.
-
Value negotiation may be assisted by means of default values provided by the
implementer.
-
Multiway rendezvous supported: synchronisation, value matching, value
exchange, broadcasting, ...
-
Recursive and dynamic creation of processes supported.
-
Automatic scheduling embedded; external scheduling is optional.
Axel Belinfante.
Wed Oct 5 19:28:49 MET 1994