A complete axiomatisation for trace congruence of finite state behaviors

  • Alexander Rabinovich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 802)


Inference Rule Regular Expression Proof System Deterministic System Successor Action 
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]
    M. Hennesy and R. Milner. Algebraic laws for nondeterminism and concurrency. In J. Assoc. Comp. Mach., volume 32, pp. 137–161, 1985.Google Scholar
  2. [2]
    R. Milner. A complete proof system for a class of regular behaviors. In JCSS, volume 28, pp. 439–466, 1984.Google Scholar
  3. [3]
    R. Milner. A complete axiomatisation for observational Congruence of finite state behaviors. In Information and Computation, volume 81, pp. 227–247, 1989.Google Scholar
  4. [4]
    A. Salomaa. Two complete axiom systems for the algebra of regular events. In J. Assoc. Comp. Mach., volume 13(1) pp. 158–169, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Alexander Rabinovich
    • 1
  1. 1.Department of Computer ScienceThe University of Texas at El PasoEl Paso

Personalised recommendations