Skip to main content
SpringerLink
Log in

On the Confluence of Trace Rewriting Systems

  • Conference paper
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Book, R.V., Otto, F.: String–Rewriting Systems. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  2. Cori, R., Métivier, Y.: Recognizable subsets of some partially abelian monoids. Theoretical Computer Science 35, 179–189 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Diekert, V.: Combinatorics on Traces. In: Diekert, V. (ed.) Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)

    Google Scholar 

  4. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  5. Duboc, C.: Mixed procuct and asynchronous automata. Theoretical Computer Science 48, 183–199 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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. Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 1978, Aarhus University, Aarhus (1977)

    Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Wrathall, C., Diekert, V.: On confluence of one-rule trace-rewriting systems. Mathematical Systems Theory 28, 341–361 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications 21, 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, 70565, Stuttgart

    Markus Lohrey

Authors
  1. Markus Lohrey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lohrey, M. (1998). On the Confluence of Trace Rewriting Systems. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation