libFAUDES
Sections
|
libFAUDES User ReferenceThe user reference provides libFAUDES documentation on faudes-types and faudes-functions relevant to users of libFAUDES based applicatione like e.g. luafaudes or DESTool. The user reference is complemented by the comprehensive and more technical C++ API documentation. A good starting point for a first reading is the section CoreFaudes, which documents general purpose functions on generators, e.g. regular expressions. The remaining sections loosely correspond to libFAUDES plug-ins, which provide specialised faudes-types and faudes-functions to address specific approaches to the design or analysis of discrete event systems. Sections present in this copy of libFAUDES are: CoreFaudes, Simulator (see also navigation on the left). TypesFaudes-typed objects are characterised by their configuration data, which can be read from or written to a file. The corresponding file formats are based on sequences of tokens that form nested sections to hold sets or lists of strings or integers. For example, the alphabet Sigma = {alpha, beta, gamma} is represented as <Alphabet> "alpha" "beta" "gamma" </Alphabet> Faudes-types available in this copy of libFAUDES are:
FunctionsFaudes-functions implement operations to be performed on faudes-typed parameters. Each faudes-function has one or more signatures to specify supported parameter types. For example, the function for the parallel composition of two generators has the following signature: Signature:
Parallel(+In+ Generator G1, +In+ Generator G2, +Out+ Generator GRes) A parameter that remains constant during the execution of a function is referred to as an argument, indicated by +In+. A parameter, that does not affect the outcome of the function, but that does change its value during execution, is referred to as a result, indicated by +Out+. Other parameters are flagged +InOut+. Faudes-functions available in this copy of libFAUDES are:
LiteratureThe following list of references is assembled from the plug-ins available in this copy of libFAUDES. It is meant to acknowledge research contributions relevant to the implemented algorithms and may serve as a starting point for a deeper literature review. [C1] W.M. Wonham: Supervisory Control of Discrete-Event Systems, available at University of Toronto, 2009 (revised). [C2] C.G. Cassandras, S. Lafortune: Introduction to Discrete Event Systems, 2007 (2nd ed). [C3] E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages, and Computation, 1979. |
libFAUDES 2.22k --- 2013.04.02 --- with "timed-iodevice-simulator"