Regularity is Decidable for Normed PA Processes in Polynomial Time

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	KUČERA Antonín
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	Faculty of Informatics
Citation
Field	Computer hardware and software
Keywords	concurrency; process algebras; bisimilarity; regularity
Related projects:	Analysis of Concurrent Infinite State Systems Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing