4 papers
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…
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…
Experiences in Developing Time-Critical Systems - The Case Study "Production Cell"
Jochen Burghardt
Starting from an informal requirements description of a toy production cell used in an intra-project competition in 1994, we give a formal specification that is as close as possibl…
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…