A regular viewpoint on processes and algebra

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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Lodaya Kamal
Testületi szerző: International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő)
Dokumentumtípus: Cikk
Megjelent: 2006
Sorozat:Acta cybernetica 17 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12794
LEADER 01633nab a2200229 i 4500
001 acta12794
005 20220616095502.0
008 161015s2006 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Lodaya Kamal 
245 1 2 |a A regular viewpoint on processes and algebra  |h [elektronikus dokumentum] /  |c  Lodaya Kamal 
260 |c 2006 
300 |a 751-762 
490 0 |a Acta cybernetica  |v 17 No. 4 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
710 |a International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő) 
856 4 0 |u http://acta.bibl.u-szeged.hu/12794/1/Lodaya_2006_ActaCybernetica.pdf  |z Dokumentum-elérés