Showing cs.LOShow all
3 papers · 1 filter
cs.LO2014
Eine entscheidbare Klasse n-stelliger Horn-Prädikate
Jochen Burghardt
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predica…
cs.LO2014
Formale Entwicklung einer Steuerung für eine Fertigungszelle mit SYSYFOS
Jochen Burghardt
Using the synthesis approach of Manna and Waldinger, a formally specified and verified control circuitery for a production cell was developped. Building an appropriate formal langu…
cs.LO2014
Axiomatization of Finite Algebras
Jochen Burghardt
We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a…