Institute of Informatics
Acta Cybernetica
Past Issues
Volume 17, Number 4, 2006
A regular viewpoint on processes and algebra
# A regular viewpoint on processes and algebra

**Kamal Lodaya**

### Abstract (in LaTeX format)

While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey of process algebra from a very narrow viewpoint, that of finite automata and regular languages. What have automata theorists learnt from process algebra about finite state concurrency? The title is stolen from [Lugiez2002]. There is a recent survey article on finite state processes which deals extensively with rational expressions. The aim of the present article is different. How do standard notions such as Petri nets, Mazurkiewicz trace languages and Zielonka automata fare in the world of process algebra? This article has no original results, and the attempt is to raise questions rather than answer them.\footnote{ For some related questions in the world of process calculi, see [Aceto2003].}

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Lodaya:2006:ActaCybernetica,`

author = {Kamal Lodaya},

title = {A regular viewpoint on processes and algebra},

journal = {Acta Cybernetica},

year = {2006},

volume = {17},

number = {4},

pages = {751--763},

abstract = {While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey of process algebra from a very narrow viewpoint, that of finite automata and regular languages. What have automata theorists learnt from process algebra about finite state concurrency? The title is stolen from [Lugiez2002]. There is a recent survey article on finite state processes which deals extensively with rational expressions. The aim of the present article is different. How do standard notions such as Petri nets, Mazurkiewicz trace languages and Zielonka automata fare in the world of process algebra? This article has no original results, and the attempt is to raise questions rather than answer them.\footnote{ For some related questions in the world of process calculi, see [Aceto2003].}}

}