Home | Trees | Indices | Help |
|
---|
|
Finite State Machines Module
Classes | |
Transducer Sequential Transducer, i.e., a letter-to-letter function. |
|
MooreMachine Moore machine. |
|
MealyMachine Mealy machine. |
Functions | |||
|
|||
|
|||
(states, output_sequences) where:
|
|
||
|
|||
|
|||
MealyMachine |
|
||
MooreMachine |
|
||
|
|||
|
|||
|
Variables | |
pure =
|
|
__package__ = None hash(x) |
Function Details |
Create proper port domains of valuations, given port types.
|
Run deterministic machine reacting to given inputs.
|
Return run from given state for N random inputs. Inputs selected randomly in a way that does not block the machine So they are not arbitrarily random. If the machine is a valid synthesis solution, then all safe environment inputs can be generated this way. Randomly generated inputs may violate liveness assumption on environment.
|
Run input-deterministic Mealy machine using user input.
|
Convert Moore machine to equivalent Mealy machine. Reference
|
Convert Mealy machine to almost equivalent Moore machine. A Mealy machine cannot be transformed to an equivalent Moore machine. It can be converted to a Moore machine with an arbitrary initial output, which outputs the Mealy output at its next reaction. Reference
|
Remove ports in For example, to remove the atomic propositions labeling the transition
system
>>> strip_ports(mealy, ts.atomic_propositions)
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sat Nov 19 00:11:17 2016 | http://epydoc.sourceforge.net |