A regular viewpoint on processes and algebra

Lodaya, Kamal: A regular viewpoint on processes and algebra. Acta cybernetica, (17) 4. pp. 751-762. (2006)

[img] Cikk, tanulmány, mű

Download (165kB)


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 [31]. There is a recent survey article [7] 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.

Item Type: Article
Event Title: International Conference on Automata and Formal Languages, 11., 2005, Dobogókő
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 4
Page Range: pp. 751-762
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 760-763.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:23
URI: http://acta.bibl.u-szeged.hu/id/eprint/12794

Actions (login required)

View Item View Item