Regularity is Decidable for Normed PA Processes in Polynomial Time
| Authors | |
|---|---|
| Year of publication | 1996 |
| Type | Article in Proceedings |
| Conference | Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96) |
| MU Faculty or unit | |
| Citation | |
| Field | Computer hardware and software |
| Keywords | concurrency; process algebras; bisimilarity; regularity |
| Related projects: |