CheckQuantificationSchedule()
Given a list of clusters representing the relations this function checks if the schedule is correct.
CommandAddFairness()
Adds a fairness constraint to the model
CommandAddInit()
Modifies the set of initial states.
CommandAddTrans()
Modifies the transition relation
CommandBuildModel()
Compiles the flattened hierarchy into BDD
CommandBuildVariables()
Builds the BDD variables necessary to compile the model into BDD.
CommandComputeFairnessConstraints()
Evaluates the fairness constraints
CommandDumpModel()
Saves the current internal representation of the model
CommandFlattenHierarchy()
Flattens the hierarchy of modules
CommandGetInternalStatus()
Implements the get_internal_status command
CommandGo()
Implements the go command
CommandIwls95PrintClusterInfo()
Prints out the information of the Iwls95 clustering.
CommandIwls95PrintOption()
Prints the Iwls95 Options.
CommandProcessModel()
Performs the batch steps and then returns control to the interactive shell.
CommandRestoreModel()
Restores the model after interactive model modification.
CommandShowVars()
Shows model's symbolic variables and their values
CommandWriteOrder()
Writes variable order to file.
CompileEncodeVarRecur()
Encodes a scalar variables into boolean variables.
Compile_BuildVarsBdd()
The ADD variables are built.
Compile_CheckProgram()
Semantic checks on the model.
Compile_CompileFrame()
Computes the ADD representing what does not change between two consecutive states.
Compile_CompileInit()
Computes the init_bdd.
Compile_CompileModelConj()
Builds an implicitly conjoined transition relation.
Compile_CompileModelDisj()
Builds the disjunctively partitioned transition relation.
Compile_CompileModelIwls95()
The implicitly conjoined transition relation is computed accordingly to the heuristic described in IWLS95.
Compile_CompileModel()
Builds the the transition relation of the model.
Compile_EncodeVarsInit()
Initializes the data structure relative to BDD variables.
Compile_EncodeVar()
Encode a variable into BDD.
Compile_End()
Shut down the compile package
Compile_FlattenHierarchy()
Traverses the module hierarchy and extracts the information needed to compile the automaton.
Compile_GetOrdering()
Return the list of variables corresponding to the current order of variables in the system.
Compile_Init()
Initializes the compile package.
Compile_ReadOrder()
reads from a file the variable order.
Compile_WriteOrder()
Writes on a file the variable order.
Iwls95CLuster_equal()
Checks if two clusters are equal.
Iwls95ClusterInfoAlloc()
Allocates and initializes memory for Iwls95Cluster_Info struct.
Iwls95ClusterInfoFree()
Frees the memory allocated for Iwls95Cluster_Info struct.
Iwls95ComputeBenefit()
Computes the benefit of the given cluster.
Iwls95ComputeCLustersCube()
Computes the cube of the set of support of all the clusters.
Iwls95ComputeClusterInfoAux()
Computes some global parameters necessary in the ordering of clusters.
Iwls95ComputeClusterInfo()
Computes the parameters necessary to use iwls95
Iwls95Compute_Supp_Q_Ci()
Computes the set Supp_Q_Ci.
Iwls95CubeAnd()
Return the intersection of two cubes.
Iwls95DeleteCluster()
Deletes a given cluster from a list of clusters.
Iwls95FreeClustersList()
Frees a list of Iwls95Cluster_Info struct.
Iwls95GetOptions()
Gets the necessary options for computing the image and returns in the option structure.
Iwls95MakeClusters()
Forms the clusters of relations based on BDD size heuristic.
Iwls95MakePartition()
Given a list of cluster, this function initializes the data structures to perform image computation.
Iwls95OrderClusters()
This function orders the clusters given as input accordingly with the order heuristic described in IWLS95.
Iwls95PrintClustersInfo()
Prints out the info for each cluster.
Iwls95PrintCluster()
Prints the cluster information.
Iwls95PrintOption()
Prints the option values used in IWLS95 technique for image computation.
IwlsCheckMonolithic()
Checks that the And_i Ti == Mon_T
add_count_states()
Return the number of states of a given ADD.
add_divide()
Divides two integer ADDs
add_gt()
Checks if two integer ADDs are in the less then relation.
add_lt()
Checks if two integer ADDs are in the less then relation.
add_minus()
Subtracts two integer ADDs
add_mod()
Computes the modulo of the integer division of two integer ADDs.
add_plus()
Adds two integer ADDs
add_shift_backward()
Shift the given set from next variables to current ones.
add_shift_forward()
Shift the given set from current variables to next ones.
add_times()
Multiplies two integer ADDs
add_to_bdd_and_abstract_input()
Abstract the input variables from the given BDD.
add_union()
Computes the set union of two set ADDs.
bdd_count_states()
Return the number of states of a given BDD.
bdd_pick_one_state_rand()
Extracts a random minterm from a given BDD.
bdd_pick_one_state()
Extracts a minterm from a given BDD.
bdd_shift_backward()
Shift the given set from next variables to current ones.
bdd_shift_forward()
Shift the given set from current variables to next ones.
binary_op()
Applies binary operation.
build_model_monolithic()
Builds the monolithic transition relation.
build_proc_selector_recur()
Performs the recursive step of build_proc_selector.
build_proc_selector()
Creates the running ADD variable.
build_real_state_variables()
Computes the real_state_variables, a list of ADDs, one for each symbolic scalar variable.
check_assign_both()
Given a variable, it checks if there are multiple assignments to it.
check_assign()
Checks for multiple or circular assignments.
check_circular_assign()
Performs circular assignment checking
check_circ()
Checks for circular definitions.
compileCompileModelConjRecur()
Recursively build the portioned transition relation.
compileCompileModelIwls95Recur()
Given a list of expression, then the corresponding list of ADD is returned.
compute_fairness_constraints()
Computes the set of fairness constraints BDD.
create_process_symbolic_variables()
Creates the internal process selector variable.
divide_op()
Divide two integers
enforce_definition()
Returns the definition of a symbol, if defined else report an error.
eval_num()
Evaluates a number in a context.
eval_recur()
Performs the recursive step of the eval function.
eval_sign()
Complements an ADD according to a flag.
eval_simplify()
Evaluates the expression given as input in the corresponding context and then simplifies the result using assumption.
eval_struct_recur()
Performs the recursive step of eval_struct.
eval_struct()
Takes an expression representing an identifier and recursively evaluates it.
eval_tree()
Given a list of expressions, this returns the list of the corresponding ADD.
eval()
Given an expression the corresponding ADD is returned back.
free_state_vars()
Free the array necessary to extract minterms.
get_bdd_input_var()
Adds a new boolean variable to the DD package.
get_bdd_state_var()
Adds a new boolean variable to the DD package.
get_definition()
Given a symbol, the corresponding ADD is returned.
gt_op()
Checks if an integer is greater then the other.
if_then_else_op()
Evaluates if_then_else expressions returning the ADD representing IF ifarg THEN thenarg ELSE elsarg.
init_check_program_recur()
Recursive step of init_check_program
init_check_program()
Initializes the data structure to perform semantic checks.
init_state_vars()
Initializes the array necessary to extract minterms from BDDs
instantiate_by_name()
Starts the flattening from a given point in the module hierarchy.
instantiate_vars()
Recursively applies instantiate_var.
instantiate_var()
Instantiates the given variable.
instantiate()
Instantiates all in the body of a module.
lt_op()
Checks if an integer is less then the other.
make_params()
Builds the parameters of a module from the list of formal parameters of the module itself.
make_quantifiers()
Computes the cube to be quantified for each cluster.
make_state_vars()
Creates the array necessary to extract minterms from a BDD.
make_support_list()
Given a list of {A|B}DDs then return the list of the corresponding set of support.
minus_op()
Subtracts two integers
mod_op()
Computes the modulo of the division of two integers
node_divide()
Divides two integer nodes.
node_equal()
Checks for node equality.
node_gt()
Checks if an integer node is greater then the other.
node_lt()
Checks if an integer node is less then the other.
node_minus()
Subtracts two integer nodes.
node_mod()
Computes the modulo of the division between two integer nodes.
node_plus1()
Adds 1 to an integer node.
node_plus()
Adds two integer nodes.
node_setin()
Set inclusion
node_times()
Multiplies two integer nodes.
node_union()
Computes the set union of two s_expr.
numeric_op()
Applies generic function to two operands.
plus_op()
Adds two integers.
print_conj_part_detailed_info()
Prints the symbolic variables of each partition and each cluster.
print_conj_part_info()
Prints the BDD size of the transitions.
print_disj_part_info()
Prints the BDD size of the partitions.
print_iwls95cp_detailed_info()
print_iwls95cp_part_info()
print_model_statistic()
Prints out model statistics.
print_monolithic_info()
Prints statistical information on monolithic transition relation.
print_state_vars()
Prints out the symbolic names of boolean variables stored in a cube.
print_state()
Prints out the state represented by the given minterm.
put_in_context()
Put a variable in the current "context"
quaternary_op()
Applies quaternary operation.
range_check()
Checks if the values of n is in the range allowed for the variable.
reset_encode()
Reset the counters necessary to the encoder.
sym_intern()
Builds an internal representation for a given string.
ternary_op()
Applies ternary operation.
times_op()
Multiplies two integers
unary_op()
Applies unary operation.
()
Return value in case an error occurs.
()
Return value used to indicate that the evaluation of an atom is not yet terminated.
()
The "running" symbol.
()
The symbolic name of the input process selector variable.

Last updated on 990908 16h51