Regularity is Decidable for Normed PA Processes in Polynomial Time
KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series. Brno: FI MU, 1996, vol. 1996, RS-96-01, p. 1-17. |
Other formats:
BibTeX
LaTeX
RIS
|
Basic information | |
---|---|
Original name | Regularity is Decidable for Normed PA Processes in Polynomial Time |
Authors | KUČERA, Antonín. |
Edition | FI MU Report Series, Brno, FI MU, 1996. |
Other information | |
---|---|
Original language | English |
Type of outcome | Article in a journal |
Field of Study | 20206 Computer hardware and architecture |
Country of publisher | Czech Republic |
Confidentiality degree | is not subject to a state or trade secret |
RIV identification code | RIV/00216224:14330/96:00001753 |
Organization unit | Faculty of Informatics |
Keywords in English | process algebras; regularity; bisimilarity |
Tags | bisimilarity, process algebras, regularity |
Changed by | Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 13:47. |
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 |
PrintDisplayed: 2/9/2024 13:20