Efficient symbolic computation of process expressions

  • Authors:
  • Benoît Fraikin;Marc Frappier

  • Affiliations:
  • GRIL, Département dInformatique, Université de Sherbrooke, Sherbrooke, Québec, Canada, J1K 2R1;GRIL, Département dInformatique, Université de Sherbrooke, Sherbrooke, Québec, Canada, J1K 2R1

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes three optimization techniques for the eb^3 process algebra. The optimizations are expressed in a new deterministic operational semantics which is shown to be trace-equivalent to a traditional non-deterministic operational semantics. Internal action transitions are eliminated by an efficient preruntime analysis of the structure of a process expression. Execution environments are used to optimize variable instantiation using lazy evaluation. Non-determinism is eliminated by returning a choice between possible transitions. This new operational semantics is implemented in the eb^3pai process algebra interpreter to support the eb^3 method. The goal of this method is to automate the development of information systems using, among other mechanisms, efficient symbolic computation of process expressions.