libFAUDES

Sections

Types

Functions

Misc Functions on Generators

EmptyLanguage

Set generator to mark empty language.

Signature:

EmptyLanguage(+In+ EventSet Sigma, +Out+ Generator GRes)

Detailed description:

Returns a generator G with the specified alphabet Sigma, one initial state and no no transitions; i.e., we have Lm(G) = 0, and L(G) = {epsilon}.

Parameter Conditions:

The empty language generator is deterministic.

IsEmptyLanguage

Test Generator G for empty marked language Lm(G).

Signature:

IsEmptyLanguage(+In+ Generator GArg, +Out+ Boolean BRes)

Parameter Conditions:

The argument may be non-deterministic.

Automaton

Convert generator to formal automaton.

Signature:

Automaton(+InOut+ Generator GArg)
Automaton(+InOut+ Generator GArg, +In+ EventSet Sigma)

Detailed description:

Converts the given generator G to a formal automaton that generates the same marked language Lm(G) while accepting any input string, i.e. L(G) = Sigma*. This is achieved by introducing a dump state to represent Sigma*-Closure(Lm(G)).

Example:

G GRes

Parameter Conditions:

The argument must be deterministic, and so will be the result.

Parameter Conditions:

The provided generator is assumed to be deterministic. The resulting generator is guaranteed to be deterministic.

PrefixClosure

Compute prefix closure for given language.

Signature:

PrefixClosure(+InOut+ Generator GArg)

Detailed description:

A language L is prefix-closed if for each string  L all prefixes r<s are also element of L:

 L and r ≤ s        r  L.

For any language L there exists a smallest prefix-closed superset, the so-called prefix-closure of L:

Closure(L) := {r  Sigma*|  s  L : r ≤ s}.

This function computes a realisation of the prefix-closure of Lm(GArg) by first erasing all states that are not co-accessible and then marking the remaining states.

Example:

G GRes

libFAUDES 2.14g --- 2009-12-3 --- plugins "example synthesis observer diagnosis hiosys multitasking timed simulator iodevice luabindings"