KUČERA, Antonín and Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer, 1999, p. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{207311, author = {Kučera, Antonín and Mayr, Richard}, address = {Berlin}, booktitle = {Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99)}, keywords = {verification; concurrency; weak bisimilarity; infinite-state systems}, language = {eng}, location = {Berlin}, isbn = {3-540-66425-4}, pages = {368-382}, publisher = {Springer}, title = {Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time}, year = {1999} }
TY - JOUR ID - 207311 AU - Kučera, Antonín - Mayr, Richard PY - 1999 TI - Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time VL - Lecture Notes in Computer Science, vol. 1664 PB - Springer CY - Berlin SN - 3540664254 KW - verification KW - concurrency KW - weak bisimilarity KW - infinite-state systems ER -
KUČERA, Antonín and Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In \textit{Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99)}. Berlin: Springer, 1999, p.~368-382. Lecture Notes in Computer Science, vol. 1664. ISBN~3-540-66425-4.
|