Normal Form in DI-Algebra with Recursion

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Paul G. Lucassen Articles by Indra Polak Articles by Jan Tijmen Udding

Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97)

Eindhoven, THE NETHERLANDS

April 07-April 10

ISBN: 0-8186-7922-0

	ASCII Text	x
	Paul G. Lucassen, Indra Polak, Jan Tijmen Udding, "Normal Form in DI-Algebra with Recursion," Asynchronous Circuits and Systems, International Symposium on, pp. 167, Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997.

	BibTex	x
	@article{ 10.1109/ASYNC.1997.587172, author = {Paul G. Lucassen and Indra Polak and Jan Tijmen Udding}, title = {Normal Form in DI-Algebra with Recursion}, journal ={Asynchronous Circuits and Systems, International Symposium on}, volume = {0}, year = {1997}, isbn = {0-8186-7922-0}, pages = {167}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASYNC.1997.587172}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asynchronous Circuits and Systems, International Symposium on TI - Normal Form in DI-Algebra with Recursion SN - 0-8186-7922-0 SP EP A1 - Paul G. Lucassen, A1 - Indra Polak, A1 - Jan Tijmen Udding, PY - 1997 VL - 0 JA - Asynchronous Circuits and Systems, International Symposium on ER -

Paul G. Lucassen, University of Groningen

Indra Polak, University of Groningen

Jan Tijmen Udding, University of Groningen

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASYNC.1997.587172

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.

Citation:

Paul G. Lucassen, Indra Polak, Jan Tijmen Udding, "Normal Form in DI-Algebra with Recursion," async, pp.167, Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.