Regularity is Decidable for Normed PA Processes in Polynomial Time

KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. V. Chandru, V. Vinay (Eds.). In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96). Berlin: Springer, 1996, p. 111-122. Lecture Notes in Computer Science, vol. 1180. ISBN 3-540-62034-6.

Basic information

Original name

Regularity is Decidable for Normed PA Processes in Polynomial Time

Authors

KUČERA, Antonín
V. Chandru, V. Vinay (Eds.).

Edition

Berlin, Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96), p. 111-122, Lecture Notes in Computer Science, vol. 1180, 1996

Publisher

Springer

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

20206 Computer hardware and architecture

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

RIV identification code

RIV/00216224:14330/96:00000074

Organization unit

Faculty of Informatics

ISBN

3-540-62034-6

Keywords in English

concurrency; process algebras; bisimilarity; regularity

Tags

bisimilarity, concurrency, process algebras, regularity

---

Links

GA201/93/2123, research and development project	Name: Analýza konkurentních nekonečně stavových systémů Investor: Czech Science Foundation, Analysis of Concurrent Infinite State Systems
MSM 143300001, plan (intention)	Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing