For information on the authors, as far as they belong to the working
group, see the list of
current and former staff.
C.-P. Wirth and U. Kühler.
Conditional Equational Specifications of Data Types with Partial Operations
for Inductive Theorem Proving.
In H. Comon, editor,
Rewriting Techniques and Applications, volume
1232 of
LNCS. Springer, 1997.
Andreas Schowalter.
Modellierung einer Produktionszelle in einer Kombination aus statecharts und
TLA.
Fachbereich Informatik, Universität Kaiserslautern, 1997.
Projektarbeit.
Andrea Sattler-Klein.
New undecidability results for finitely presented monoids.
In H.Comon, editor,
Rewriting Techniques and Applications, volume
1232 of
LNCS, pages 68-82. Springer, 1997.
Christian Peper, Reinhard Gotzhein, and Martin
Kronenburg.
Formal Specification of Real-Time Requirements for Building Automation
Systems.
SFB 501 Report No. 01/97, SFB 501 University of Kaiserslautern, 1997.
Full Paper.
Christian Peper, Reinhard Gotzhein, and Martin
Kronenburg.
A Generic Approach to the Formal Specification of Requirements.
In
1st IEEE International Conference on Formal Engineering Methods
(ICFEM'97), 1997.
Full Paper.
Friedrich Otto and Andrea Sattler-Klein.
Some remarks on finitely presented monoids with automatic structure.
Mathematische Schriften Kassel 9/97, Universität-GH Kassel, 1997.
Full Paper.
Friedrich Otto and Andrea Sattler-Klein.
FDT is undecidable for finitely presented monoids with solvable word
problems.
Mathematische Schriften Kassel 3/97, Universität-GH Kassel, 1997.
Full Paper.
Friedrich Otto and Andrea Sattler-Klein.
FDT is undecidable for finitely presented monoids with solvable word
problems.
In T.B.S.Chlebus and L.Czaja, editors,
11th Int. Symp. Fundamentals of
Computation Theory, FCT'97, volume 1279 of
LNCS. Springer,
1997.
Klaus Madlener and Birgit Reinert.
String Rewriting and Gröbner Bases -- A General Approach to Monoid and
Group Rings.
Reports On Computer Algebra No 16, Centre for Computer Algebra.
Universität Kaiserslautern, 1997.
Abstract,
Full Paper.
Klaus Madlener and Birgit Reinert.
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids
and Ideals in Monoid Rings.
Reports On Computer Algebra No 14, Centre for Computer Algebra.
Universität Kaiserslautern, 1997.
Abstract,
Full Paper.
Klaus Madlener and Birgit Reinert.
A Generalization of Gröbner Bases Algorithms to Nilpotent Group Rings.
Applicable Algebra in Engineering, Communications and Computing,
8 no. 2 pp. 103-123, 1997.
Abstract.
K. Madlener and F. Otto.
Some Undecidability Results for Finitely Generated Thue Congruences on a
Two-Letter Alphabet.
Fundamenta Informatica,
30 no. 1 pp. 31-44, 1997.
K. Madlener and J. Avenhaus.
Theorem Proving in Hierarchical Clausal Specifications.
In D. Du and K. Ko, editors,
Advances in Algorithms, Languages, and
Complexity, pages 1-52. Kluwer Academic Press, 1997.
Robert Eschbach and Inger Sonntag.
PLATIN: A Planning System for Inductive Theorem Proving - Implementation and
Experiences.
Report SR-97-02, SEKI University of Kaiserslautern, 1997.
Abstract,
Full Paper.
Thomas Deiß, Martin Kronenburg, and Dirk Zeckzer.
A Catalogue of Criteria for Evaluating Formal Methods and Its Application.
SFB 501 Report No. 04/97, SFB 501 University of Kaiserslautern, 1997.
Abstract,
Full Paper.
Thomas Deiß and Thomas Hillenbrand.
A Case Study on the Use of SDL.
SFB 501 Report No. 03/97, SFB 501 University of Kaiserslautern, 1997.
Abstract,
Full Paper.
