Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Author： Kucera  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 677-700

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Probabilistic weak simulation is decidable in polynomial time

By Baier C.   Hermanns H.   Katoen J.-P.  

Information Processing Letters, Vol. 89, Iss. 3, 2004-02 ,pp. : 123-130

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for deciding bisimilarity of normed context-free processes

By Hirshfeld Y.   Jerrum M.   Moller F.  

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 143-159

Elsevier

Access to resources Recommend Favorite

Hardness of equivalence checking for composed finite-state systems

By Sawa Zdeněk  

Acta Informatica, Vol. 46, Iss. 3, 2009-05 ,pp. : 169-191

Springer Publishing Company

Access to resources Recommend Favorite

Fixed point characterization of infinite behavior of finite-state systems

By Niwinski D.  

Theoretical Computer Science, Vol. 189, Iss. 1, 1997-12 ,pp. : 1-69

Elsevier

Access to resources Recommend Favorite

Exploiting transition locality in automatic verification of finite-state concurrent systems

By Della Penna Giuseppe   Intrigila Benedetto   Melatti Igor   Tronci Enrico   Venturini Zilli Marisa  

International Journal on Software Tools for Technology Transfer, Vol. 6, Iss. 4, 2004-08 ,pp. : 320-341

Springer Publishing Company

Access to resources Recommend Favorite