Normal form in DI-algebra with recursion
- Already Purchased? View Article
- Subscription Options Learn More
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
Published in:
Advanced Research in Asynchronous Circuits and Systems, 1997. Proceedings., Third International Symposium on
Date of Conference: 7-10 Apr 1997