For information on the authors, as far as they belong to the working
group, see the list of
current and former staff.
Andrea Sattler-Klein.
Phänomene der Knuth-Bendix Vervollständigung.
In
Ausgezeichnete Informatikdissertationen 1996, Dissertationspreise
der Gesellschaft für Informatik. Teubner, 1998.
Birgit Reinert and Dirk Zeckzer.
MRC -- A System for Computing Gröbner Bases in Monoid and Group Rings.
Reports on Computer Algebra No 20, Centre for Computer Algebra, University of
Kaiserslautern, 1998.
Abstract,
Full Paper.
Birgit Reinert and Dirk Zeckzer.
MRC -- A System for Computing Gröbner Bases in Monoid and Group Rings.
presented at the 6th Rhine Workshop on Computer Algebra. Sankt Augustin,
1998.
Abstract,
Full Paper.
Birgit Reinert.
Observations on Coset Enumeration.
Reports on Computer Algebra No 23, Centre for Computer Algebra.
Universität Kaiserslautern, 1998.
Abstract,
Full Paper.
B. Reinert, K. Madlener, and T. Mora.
A Note on Nielsen Reduction and Coset Enumeration.
In
ISSAC'98, pages 171-178, 1998.
Abstract.
B. Reinert, K. Madlener, and T. Mora.
A Note on Nielsen Reduction and Coset Enumeration.
Reports on Computer Algebra No 19, Centre for Computer Algebra, University of
Kaiserslautern, 1998.
Abstract,
Full Paper.
Klaus Madlener and Birgit Reinert.
String Rewriting and Gröbner Bases -- A General Approach to Monoid and
Group Rings.
In
Proceedings of the Workshop on Symbolic Rewriting Techniques, Monte
Verita, 1995, pages 127-180. Birkhäuser, 1998.
Abstract.
Klaus Madlener and Birgit Reinert.
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids
and Ideals in Monoid Rings.
Theoretical Computer Science,
208 no. 1-2 pp. 3-31, 1998.
Abstract.
Klaus Madlener and Birgit Reinert.
Gröbner Bases in Non-Commutative Reduction Rings.
In B. Buchberger and F. Winkler, editors,
Gröbner Bases and
Applications, Proc. of the Conf. 33 Years in Gröbner Bases, volume
251 of
London Mathematical Society Lecture Notes Series, pages
408-420. Cambridge University Press, 1998.
Abstract.
Klaus Madlener and Birgit Reinert.
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings.
Journal of Symbolic Computation,
25 no. 1 pp. 23-45, 1998.
Abstract.
Martin Kronenburg, Thomas Deiß, and Robert Eschbach.
Temporal Logics as Examples of Formal Description Techniques for Timed
Systems.
SFB 501 Report No. 07/98, University of Kaiserslautern, 1998.
Abstract,
Full Paper.
Reinhard Gotzhein, Martin Kronenburg, and Christian
Peper.
Reuse in Requirements Engineering: Discovery and Application of a Real-Time
Requirements Pattern.
In
5th International Symposium on Formal Techniques in Real-Time and
Fault-Tolerant Systems FTRTFT'98, volume 1486 of
LNCS.
Springer, 1998.
Earlier version as SFB 501 Report No. 8/98, University of Kaiserslautern.
Reinhard Gotzhein, Martin Kronenburg, and Christian
Peper.
Reuse in Requirements Engineering: Discovery and Application of a Real-Time
Requirements Pattern.
SFB 501 Report No. 08/98, University of Kaiserslautern, 1998.
Andrea Sattler-Klein Friedrich Otto and Klaus Madlener.
Automatic monoids versus monoids with finite convergent presentations.
In T. Nipkow, editor,
Rewriting Techniques and Applications, volume
1379 of
LNCS, pages 32-46. Springer, 1998.
Robert Eschbach, Thomas Deiß, and Martin Kronenburg.
A Framework for the Analysis of Formal Description Techniques for Timed
Systems.
SFB 501 Report No. 05/98, SFB 501 University of Kaiserslautern, 1998.
Abstract,
Full Paper.
