For information on the authors, as far as they belong to the working
group, see the list of current and former staff.
Dirk Zeckzer.
Implementation, Applications, and Complexity of Prefix Gröbner Bases
in Monoid and Group Rings.
Phdthesis, Department of Computing Science, University of Kaiserslautern,
2000.
Birgit Reinert.
Solving One-sided Equations in Integer Monoid Rings.
In
Proceedings ISSAC 2000, 2000.
Abstract.
Birgit Reinert.
Solving One-sided Equations in Integer Monoid Rings.
Reports on Computer Algebra No 26, Centre for Computer Algebra.
Universität Kaiserslautern, 2000.
Abstract,
Full Paper.
S. Queins, G. Zimmermann, M. Becker, M. Kronenburg,
C. Peper, R. Merz, and J. Schäfer.
The Light Control Case Study: Problem Description.
Journal of Universal Computer Science, Special Issue on Requirements
Engineering,
6 no. 7 pp. 586-596, 2000.
Andreas Prinz, Robert Eschbach, and Reinhard Gotzhein.
An Executable Formal Semantics for SDL-2000.
In
Proc. of SAM 2000, 2nd Workshop of the SDL Forum Society on SDL and
MSC, 2000.
Friedrich Otto and Andrea Sattler-Klein.
The property FDT is undecidable for finitely presented monoids that have
polynomial-time decidable word problems.
Int. J. of Algebra and Computation,
10 no. 3 pp. 285-307,
2000.
Klaus Madlener and Birgit Reinert.
Non-Commutative Reduction Rings.
Revista Colombiana de Matematicas, 2000.
Abstract.
Klaus Madlener.
Non-Commutative Gröbnerbases: Applications and Open Problems (Extended
Abstract).
In
Simposio de Algebra, Teoria de Numeros, Computacion,
14.08-18.08.2000, 2000.
Martin Kronenburg and Christian Peper.
Application of the FOREST Approach to the Light Control Case Study.
Journal of Universal Computer Science, Special Issue on Requirements
Engineering,
6 no. 7 pp. 679-703, 2000.
Martin Kronenburg.
An Approach to the Creation of Precise, Intelligible Problem
Specifications of Large Reactive Systems.
Phdthesis, sfb501phdthesis, Department of Computing Science, University of
Kaiserslautern, 2000.
Robert Eschbach, Reinhard Gotzhein, and Andreas Prinz.
On the Formal Semantics of SDL-2000: A Compilation Approach using Abstract
State Machines.
In
Local Proc. of ASM2000, Monte Verità, Switzerland, Monte
Verità, Switzerland, 19-24 March 2000.
A completely revised version of this paper can be found in the corresponding
LNCS publication.
Robert Eschbach, Uwe Glässer, Reinhard Gotzhein, and Andreas
Prinz.
On the Formal Semantics of SDL-2000: A Compilation Approach Based on an
Abstract SDL Machine.
In Y. Gurevich, P.W. Kutter, M. Odersky, and L. Thiele, editors,
Abstract
State Machines - Theory and Applications, number 1912 in LNCS. Springer,
2000.
Lidia Angelova, Klaus Dräger, Özgür
Göceri, Christian Mathis, Frank Michel, Dirk Niebuhr, Christoph Thelen,
and Wei Zheng.
Proseminar/Seminar Kryptographie, SS 2000.
, University of Kaiserslautern, 2000.
Ausarbeitungen der Teilnehmer.
Full Paper.
