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
@inproceedings{190126, author = {Kučera, Antonín}, address = {Berlin}, booktitle = {Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96)}, keywords = {concurrency; process algebras; bisimilarity; regularity}, language = {eng}, location = {Berlin}, isbn = {3-540-62034-6}, pages = {111-122}, publisher = {Springer}, title = {Regularity is Decidable for Normed PA Processes in Polynomial Time}, year = {1996} }
TY - JOUR ID - 190126 AU - Kučera, Antonín PY - 1996 TI - Regularity is Decidable for Normed PA Processes in Polynomial Time VL - Lecture Notes in Computer Science, vol. 1180 PB - Springer CY - Berlin SN - 3540620346 KW - concurrency KW - process algebras KW - bisimilarity KW - regularity ER -
KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. V. Chandru, V. Vinay (Eds.). In \textit{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.
|