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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Book, R.V., Otto, F.: String–Rewriting Systems. Springer, Heidelberg (1993)
Cori, R., Métivier, Y.: Recognizable subsets of some partially abelian monoids. Theoretical Computer Science 35, 179–189 (1985)
Diekert, V.: Combinatorics on Traces. In: Diekert, V. (ed.) Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)
Duboc, C.: Mixed procuct and asynchronous automata. Theoretical Computer Science 48, 183–199 (1986)
Lohrey, M.: On the confluence of trace rewriting systems (1998), Available via http://inf.informatik.uni-stuttgart.de/ifi/ti/personen/Lohrey/98a.ps
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 1978, Aarhus University, Aarhus (1977)
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)
Wrathall, C., Diekert, V.: On confluence of one-rule trace-rewriting systems. Mathematical Systems Theory 28, 341–361 (1995)
Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications 21, 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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