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.
Other formats:   BibTeX LaTeX RIS
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
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
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
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 11:32.
Links
GA201/93/2123, research and development projectName: Analýza konkurentních nekonečně stavových systémů
Investor: Czech Science Foundation, Standard Projects
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, Research Intents
PrintDisplayed: 3/8/2020 17:56