| |
libFAUDES
Sections
Types
Functions
|
Statespace ConversionDeterministicPowerset construction to enforce determinism.
Detailed description: The so called powerset- or subset-construction converts the specified generator to a deterministic generator without affecting marked and generated language. The state space of the resulting generator is a reachable subset of the powerset of the original state set. Indeed, the computational worst case is characterised by exponential growth of the number of states. See [C3] for the basic algorithm. Example:
Parameter Conditions: The resulting generator is deterministic. IsDeterministicTest for determinsim.
Detailed description: A generator is deterministic if it has exactly one initial state and transitions from each state are uniquely determined by the event label. The latter condition may be imposed on reachable states only. However, the implementation of this function returns true only if it is satisfied by all states. StateMinStateset minimization.
Detailed description: Constructs a generator with minimal stateset while preserving the generated and marked languages. This function implements the (n*log n) set partitioning algorithm by John E. Hopcroft, e.g. [C3]. The original algorithm expects an accessible input generator, the implementation will convert the argument if necessary. Example:
Parameter Conditions: The argument must be deterministic, and so will be the result. |
libFAUDES 2.14g --- 2009-12-3 --- plugins "example synthesis observer diagnosis hiosys multitasking timed simulator iodevice luabindings"