## Weak bisimilarity with infinite-state systems can be decided in polynomial time (1999)

### Cached

### Download Links

- [www.fi.muni.cz]
- [www.dcs.ed.ac.uk]
- [www.liafa.jussieu.fr]
- DBLP

### Other Repositories/Bibliography

by
Antonín Kučera
,
Richard Mayr

Venue: | In Proc. of CONCUR'99, volume 1664 of LNCS |

Citations: | 7 - 4 self |

### BibTeX

@INPROCEEDINGS{Kučera99weakbisimilarity,

author = {Antonín Kučera and Richard Mayr},

title = {Weak bisimilarity with infinite-state systems can be decided in polynomial time},

booktitle = {In Proc. of CONCUR'99, volume 1664 of LNCS},

year = {1999},

pages = {368--382},

publisher = {Springer Verlag}

}

### OpenURL

### Abstract

Abstract. We prove that weak bisimilarity is decidable in polynomial time between BPA and finite-state processes, and between normed BPP and finite-state processes. To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity with infinite-state systems. 1