Chapter

Computer Aided Verification

Volume 1633 of the series Lecture Notes in Computer Science pp 184-195

Date:

A Complete Finite Prefix for Process Algebra

  • Rom LangerakAffiliated withDepartment of Computer Science, University of Twente
  • , Ed BrinksmaAffiliated withDepartment of Computer Science, University of Twente

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm