Theory of Computing Systems

, Volume 38, Issue 1, pp 39–81 | Cite as

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids



We prove that the first-order theory of the one-step rewriting relation associated with a trace rewriting system is decidable but in general not elementary. This extends known results on semi-Thue systems but our proofs use new methods; these new methods yield the decidability of local properties expressed in first-order logic augmented by modulo-counting quantifiers. Using the main decidability result, we define several subclasses of trace rewriting systems for which the confluence problem is decidable.


Computational Mathematic Local Property Decidability Result Confluence Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Institut für Algebra, Technische Universität Dresden, D-01062 DresdenGermany
  2. 2.Institut für Formale Methoden der Informatik (FMI), Universität Stuttgart, Universitätsstrasse 38, D-70569 Stuttgart {}Germany

Personalised recommendations