Examples of wyautl.core.Automaton

wyautl.core.Automaton
type term Bool // bool type term Int // int type term Not(Type) // negation type term Or{Type...} // union of zero or more types term And{Type...} // intersection of zero or more types define Type as Void | Bool | Int | Not | Or | And
In this simple language, we can express types such as the following:
- Not(Or{Int,Bool}) --- the set of values excluding the integers and booleans
- And{Int,Bool} --- the set of values in both the integers and booleans (i.e. the empty set).
We can also see how the various components correspond to states in an automaton. Consider the following examples:
- Not(Void) --- this corresponds to an automaton with two states: 1) a term with no child representing Void; 2) a term representing Not which has a single child referring to state 1.
- Or{Int,Bool} --- corresponds to an automaton with four states: 1) a term with no child representing Int; 2) a term with no child representing Bool; 3) a set with two children referring to states 1 and 2; 4) a term representing Or with a single child referring to state 3.
Notes
- Roots. States can be explicitly marked as roots to provide a way to track them through the various operations that might be performed on an automaton. In particular, as states are rewritten, the roots will be updated accordingly.
- Minimisation. An automaton which has the strong equivalence property is said to be minimised. Automata are generally kept in the minimised form, and only use of the set() method can break this. The strong equivalence property guarantees that there are no two distinct, but equivalent states. In order to restore this property, the minimise() function must be called explicitly.
  
  Compaction. An automaton which does not contain garbage states is said to be compacted. Automata are generally kept in compacted form, and only use of the set() method can break this. Garbage states are those not reachable from any marked root state. In order to restore this property, the compact() function must be called explicitly.
- Canonical Form. An automaton which is minimised is not guaranteed to be canonical. This means we can have automata which are effectively equivalent, but which not considered identical (i.e., where equals() returns false). In some circumstance, it is desirable to move an automaton into canonical form, and this can be achieved with the canonicalise() function.
- Virtual States. In the internal representation of automata, leaf states may be not be represented as actual states. This will occur if the leaf node does not include any supplementary data, and is primarily for space and performance optimisation. In such case, the node is represented as a child node using a negative index.
@author David J. Pearce

    }


    private static void reduce(String text, RewriteMode rwMode) {
    try {
      Parser parser = new Parser(text);
      Automaton automaton = new Automaton();
      int root = parser.parse(automaton);
      automaton.setRoot(0, root);


      PrettyAutomataWriter writer = new PrettyAutomataWriter(System.out,
          Logic.SCHEMA, "Or", "And");
      System.out.println("------------------------------------");
      writer.write(automaton);

View Full Code Here

  }


  public static void check(String line) {
    boolean unsat = line.charAt(0) == 'u';
    Parser parser = new Parser(line.substring(2));
    Automaton automaton = new Automaton();
    int root = parser.parse(automaton);
    automaton.setRoot(0, root);


    StrategyRewriter.Strategy<InferenceRule> inferenceStrategy = new SimpleRewriteStrategy<InferenceRule>(
        automaton, Arithmetic.inferences);
    StrategyRewriter.Strategy<ReductionRule> reductionStrategy = new SimpleRewriteStrategy<ReductionRule>(
        automaton, Arithmetic.reductions);
    StrategyRewriter rw = new StrategyRewriter(automaton,
        inferenceStrategy, reductionStrategy, Arithmetic.SCHEMA);
    rw.apply(10000);


    boolean result = automaton.get(automaton.getRoot(0)).equals(Arithmetic.False);
    if(result != unsat) {
      System.out.println("\n\n*** TEST FAILED: " + line + "\n");
    }


    // else if(Arithmetic.numSteps >= Arithmetic.MAX_STEPS) {

View Full Code Here

    }


    private static void reduce(String text, RewriteMode rwMode) {
  try {
      Parser parser = new Parser(text);
      Automaton automaton = new Automaton();
      int root = parser.parse(automaton);
      automaton.setRoot(0, root);


      PrettyAutomataWriter writer = new PrettyAutomataWriter(System.out,
                   Types.SCHEMA, "Or", "And");
      System.out.println("------------------------------------");
      writer.write(automaton);

View Full Code Here

0 1

TOP

Related Classes of wyautl.core.Automaton

Main

TestRunner

wyautl.util.BigRational

wyautl.util.BinaryMatrix

wycs.io.WycsFileReader

wycs.io.WycsFileWriter

wycs.WycsMain

wyrl.core.TypeExpansion

wyrl.io.JavaFileWriter

wyrl.util.RewriteComplexity

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of wyautl.core.Automaton

Notes

Related Classes of wyautl.core.Automaton