Transforming Arbitrary Structures into Topologically Equivalent Slicing Structures

Configuration structures provide a model of concurrency generalizing the families of configurations of event structures. They can be considered logically, as classes of propositional models; then sub-classes can be axiomatised by formulae of simple ...

We study automatic equivalence and nested equivalence structures. The goal is to compare and contrast these automatic structures with computable equivalence and nested equivalence structures. Equivalence structures $\mathcal{A}$ may be characterized by their ...$\mathcal{}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$${\mathrm{}}_{\mathrm{}}^{\mathrm{}}$

We present a simple characterization of equivalent Bayesian network structures based on local transformations. The significance of the characterization is twofold. First, we are able to easily prove several new invariant properties of theoretical ...