CSP

• Provides an algebraic structure for analysis

  • a process algebra

• Enables us to reason about concurrent systems

  • prove that a system is deadlock-free
  • define a denotational semantics for CSP

• Tools for automated analysis are available

  • FDR (Failures/Divergences Refinement)

Previous slide

Back to first slide

View graphic version