Normal Form in DI-Algebra with Recursion

  • Authors:

  • Paul G. Lucassen;Indra Polak;Jan Tijmen Udding

  • Affiliations:

  • -;-;-

  • Venue:
  • ASYNC '97 Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however, we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph.