NORMAL-FORM IN A DELAY-INSENSITIVE ALGEBRA

R GROENBOOM*, MB JOSEPHS, PG LUCASSEN, JT UDDING

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

A process algebra is given for specifying delay-insensitive processes. We show in two steps that expressions in this algebra have a normal form, as a consequence of which the algebra is complete. First, the number of operators in process expressions is reduced by a set of rewrite laws. The resulting expressions are in a so-called pre-normal form. Secondly, we introduce some additional laws to transform a process from its pre-normal form to its normal form.

Original languageEnglish
Title of host publicationASYNCHRONOUS DESIGN METHODOLOGIES
EditorsS Furber, M Edwards
Place of PublicationAMSTERDAM
PublisherElsevier
Pages57-70
Number of pages14
ISBN (Print)0-444-81599-6
Publication statusPublished - 1993
EventIFIP WG10.5 Working Conference on Asynchronous Design Methodologies -
Duration: 31-Mar-19922-Apr-1992

Publication series

NameIFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY
PublisherELSEVIER SCIENCE PUBL B V
Volume28
ISSN (Print)0926-5473

Other

OtherIFIP WG10.5 Working Conference on Asynchronous Design Methodologies
Period31/03/199202/04/1992

Keywords

  • VLSI SYSTEMS
  • SPECIFYING AND VERIFYING AND REASONING ABOUT PROGRAMS
  • EXPRESSIONS AND THEIR REPRESENTATION

Cite this