Advertisement

On the Confluence of Trace Rewriting Systems

  • Markus Lohrey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1530)

Abstract

In [NO88], a particular trace monoid M is constructed such that for the class of length-reducing trace rewriting systems over M, confluence is undecidable. In this paper, we show that this result holds for every trace monoid, which is neither free nor free commutative. Furthermore we will present a new criterion for trace rewriting systems that implies decidability of confluence.

Keywords

Turing Machine Critical Pair Free Monoid Trace Theory Clique Covering 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BO93.
    Book, R.V., Otto, F.: String–Rewriting Systems. Springer, Heidelberg (1993)zbMATHGoogle Scholar
  2. CM85.
    Cori, R., Métivier, Y.: Recognizable subsets of some partially abelian monoids. Theoretical Computer Science 35, 179–189 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  3. Die90.
    Diekert, V.: Combinatorics on Traces. In: Diekert, V. (ed.) Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)Google Scholar
  4. DR95.
    Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)Google Scholar
  5. Dub86.
    Duboc, C.: Mixed procuct and asynchronous automata. Theoretical Computer Science 48, 183–199 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  6. Loh98.
    Lohrey, M.: On the confluence of trace rewriting systems (1998), Available via http://inf.informatik.uni-stuttgart.de/ifi/ti/personen/Lohrey/98a.ps
  7. Maz77.
    Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 1978, Aarhus University, Aarhus (1977)Google Scholar
  8. NO88.
    Narendran, P., Otto, F.: Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters 29, 125–130 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  9. WD95.
    Wrathall, C., Diekert, V.: On confluence of one-rule trace-rewriting systems. Mathematical Systems Theory 28, 341–361 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  10. Zie87.
    Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications 21, 99–135 (1987)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Markus Lohrey
    • 1
  1. 1.Institut für InformatikUniversität StuttgartStuttgart

Personalised recommendations