On the Knuth-Bendix completion for concurrent processes

  • Volker Diekert
Rewrite Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


We consider critical pairs for replacement systems over free partially commutative monoids. This is done in order to apply the Knuth-Bendix completion procedure to concurrent processes. We will see that there are systems which have no finite set of critical pairs, even if the system consists of one rule only. Therefore we develop a sufficient (and computable) condition such that finite replacement systems have a finite set of critical pairs if the condition is fullfilled. This condition is always satisfied in the purely free or purely commutative case of semi-Thue systems or vector-replacement systems. In fact, it generalizes (and unifies) both cases.


Critical Pair Finite System Replacement System Concurrent Process Commutative Case 
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.


  1. [BaLa81]
    A.M. Ballantyne, D.S. Lankford: New Decision Algorithms for finitely presented commutative Semigroups, Comp. Math. with Appl. 7 (1981), 159–165CrossRefGoogle Scholar
  2. [Book82]
    R. Book: Confluent and Other Types of Thue Systems, J. Assoc. for Comp. Math. 29 (1982), 171–182Google Scholar
  3. [Buch65,70]
    B. Buchberger: An Algorithm for Finding Basis for the Residue Class Ring of a Zero Dimensional Polynomial Ideal. Ph.D.Thesis, University of Innsbruck (1965). See also aequ.math 4/3, 374–383 (1970).Google Scholar
  4. [Buch85]
    B. Buchberger: Basic Features and Development of the Critical-Pair/Completion Procedure, in: Proceedings of Rewriting Techniques and Applications, Dijon 85, J.-P. Jouannaud (ed), LNCS 202, (1985), 1–45Google Scholar
  5. [ClLa85]
    M. Clerbout, M. Latteux: Partial Commutations and Faithful Rational Transductions, Theoret. Comp. Sci. 35, (1985), 241–254Google Scholar
  6. [CoFo69]
    P. Cartier, D. Foata: Problèmes combinatoires de commutation et rèarrengements, Lect. Not. in Math., No. 85, (1969).Google Scholar
  7. [CoMe85]
    R. Cori, Y. Métivier: Recognizable subsets of some partially abelian monoids, Theor. Comp. Sci., Vol. 35, 241–254, (1985).CrossRefGoogle Scholar
  8. [CoPe85]
    R. Cori, D. Perrin: Automates et Commutations Partielles, R.A.I.R.O., Informatique theoriques 19, No. 1, (1985), 21–32Google Scholar
  9. [Gilm71]
    R. Gilman: Presentations of Groups and Monoids, Journal of Algebra 57 (1971), 544–554CrossRefGoogle Scholar
  10. [Huet80]
    G. Huet: Confluent Reduction: Abstract Properties and Applications to Term Rewriting Systems, J. Assoc. Comp. Math. 27 (1980), 797–821Google Scholar
  11. [Mazu77]
    A. Mazurkiewicz: Concurrent Program Schemes and their Interpretations, DAIMI Rep. PB 78, Aarhus University, Aarhus (1977)Google Scholar
  12. [Mazu86]
    A. Mazurkiewicz: Trace Theory, in: Advanced Course on Petri Nets, Bad Honnef 1986, LNCS to appearGoogle Scholar
  13. [Meti86]
    Y. Métivier: On recognizable subsets of free partially commutative monoids, Lect. Not. in Comp. Sci., No. 226, (1986).Google Scholar
  14. [Perr84]
    D. Perrin: Words over a partially commutative alphabet, Report LITP No. 84–59, Paris, (1984).Google Scholar
  15. [ODun83]
    C. O'Dùnlaing: Undecidable Questions Related to Church-Rosser Thue Systems, Theor. Comp. Sci. 23 (1983), 339–345, North-Holland Publishing Company.CrossRefGoogle Scholar
  16. [Wrat87]
    C.Wrathall: The word problem for free partially commutative groups, manuscript, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Volker Diekert
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2

Personalised recommendations