Parosh Aziz Abdulla, Bengt Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science, 256(1-2):145-167, 2001. [doi]
@article{AbdullaJ01:0,
title = {Ensuring completeness of symbolic verification methods for infinite-state systems},
author = {Parosh Aziz Abdulla and Bengt Jonsson},
year = {2001},
doi = {10.1016/S0304-3975(00)00105-5},
url = {http://dx.doi.org/10.1016/S0304-3975(00)00105-5},
tags = {completeness},
researchr = {https://researchr.org/publication/AbdullaJ01%3A0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {256},
number = {1-2},
pages = {145-167},
}