Lattice structures and hierarchical COCOLOG for finite machines

The theory of the lattices of dynamically consistent partition machines of a given finite machine ℳ is briefly reviewed. A hierarchical family of COCOLOGs, called HICOLOG, is introduced to logically express multilevel control theories for ℳ. Communication takes place between the COCOLOG theories at each level of a hierarchical COCOLOG system via two sets of extra-logical rules called the instantiation rule and block membership rule. Following a brief description of a two level HICOLOG system, an example is presented of the realization of a hierarchical solution to a reachability problem