On Coherence Properties in Term Rewriting Models of Concurrency

  • Thomas Noll
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1664)


This paper introduces a generic and uniform approach to integrate different design languages for distributed systems in verification tools. It is based on Meseguer’s Rewriting Logic, hence transitions between the states of the respective system are modeled as (conditional) term rewriting steps modulo an equational theory. We argue that, for reasons of efficiency, it is intractable to admit arbitrary equations, and propose to employ rewriting modulo associativity and commutativity instead, using oriented versions of the equations. Furthermore the question is raised under which conditions this implementational restriction is complete. To this aim we define a coherence property which guarantees that every transition which is possible in the (fully equational) semantics can also be computed using the oriented equations, and we show that this property can be verified by testing the joinability of finitely many conditional critical pairs between transition rules and oriented equations.


Normal Form Equational Theory Transition Rule Critical Pair Design Language 
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. 1.
    F. Baader and J. Siekmann. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 41–125. Oxford University Press, 1994.MathSciNetGoogle Scholar
  2. 2.
    J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32(3):323–326, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 7.
    H. Ganzinger. A completion procedure for conditional equations. Journal of Symbolic Computation, 11(1-2):51–82, 1991.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 8.
    J.-P. Jouannaud and C. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155–1194, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 10.
    J. Meseguer. Conditional rewriting logic as a uniéd model of concurrency. Theoretical Computer Science, 96(1):73–155, April 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 11.
    J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Seventh International Conference on Concurrency Theory (CONCUR’96), volume 1119 of Lecture Notes in Computer Science, pages 331–372. Springer-Verlag, August 1996.Google Scholar
  7. 12.
    R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, 1989.Google Scholar
  8. 13.
    The Concurrency Workbench of North Carolina.
  9. 14.
    The Process Algebra Compiler of North Carolina.
  10. 15.
    Model checking at CMU.
  11. 16.
  12. 17.
  13. 18.
    P. Viry. Rewriting: An eéctive model of concurrency. In Proceedings of PARLE’94-Parallel Architectures and Languages Europe, volume 817 of Lecture Notes in Computer Science, pages 648–660. Springer-Verlag, 1994.Google Scholar
  14. 19.
    P. Viry. Rewriting modulo a rewrite system. Technical Report TR-95-20, Università di Pisa, Dipartimento di Informatica, December 1995.Google Scholar
  15. 20.
    P. Viry. A rewriting implementation of pi-calculus. Technical Report TR-96-30, Università di Pisa, Dipartimento di Informatica, March 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Thomas Noll
    • 1
  1. 1.Lehrstuhl für Informatik IIAachen University of TechnologyAachenGermany

Personalised recommendations