public class Milner extends ProfiledBDD2
The original code from BuDDy also includes a deadlock detection part which I haven't figured out yet (it looks kinda incomplete to me...).
CACHE_AND, CACHE_BIIMP, CACHE_EXISTS, CACHE_FORALL, CACHE_IMP, CACHE_NAND, CACHE_NOR, CACHE_OR, CACHE_RESTRICT, CACHE_XOR, ite_cache, last_sat_vars, nodeNames, not_cache, num_vars, oneSat_buffer, op_cache, quant_cache, quant_conj, quant_cube, quant_id, relprod_cache, replace_cache, restrict_careset, sat_cache, sign_vec, varset_last, varset_vecdead_nodes, ht_chain, mark_stack, NODE_MARK, NODE_UNMARK, nodesminfree, stat_gc_count, stat_gc_freed, stat_gc_time, stat_grow_time, stat_lookup_count, stat_notify_time, stat_nt_grow, table_size, work_stack, work_stack_tos| Constructor and Description |
|---|
Milner(int N) |
| Modifier and Type | Method and Description |
|---|---|
static void |
main(String[] args) |
int |
reachable_states() |
addDebugger, and, biimp, createPermutation, exists, forall, imp, ite, nand, nor, not, or, relProd, replace, report, restrict, satCount, showStats, simplify, support, xorandTo, cleanup, createVar, cube, cube, getMemoryUsage, getOne, getZero, internal_test, isVariable, member, minterm, minterm, mk, nodeCount, numberOfVariables, oneSat_rec, oneSat, oneSat, orTo, post_removal_callbak, print, printCubes, printDot, printSet, quasiReducedNodeCount, satCount_rec, setNodeNamesadd, check_all_nodes, check_node, countRootNodes, deref, enableStackMarking, gc, getHigh, getLow, getRef, getVar, getVarUnmasked, grow, invalidate, isNodeMarked, isValid, mark_node, mark_tree, match_table, ref, saturate, setAll, setAll, show_table_all, show_table, show_tuple, signal_removed, tree_depth_changed, unmark_node, unmark_tree, update_grow_parameterspublic int reachable_states()
public static void main(String[] args)
This file is a part of the JDD package, a native Java Binary Decision Diagram Library.