Probabilistic weak simulation is decidable in polynomial time

Author： Baier C. Hermanns H. Katoen J.-P.

Publisher： Elsevier

ISSN： 0020-0190

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

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

Related content

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

By Kucera

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

Elsevier

Access to resources Recommend Favorite

A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time

By Sedoglavic A.

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 735-755

Academic Press

Access to resources Recommend Favorite

A predicative and decidable characterization of the polynomial classes of languages

By Caporaso S. Zito M. Galesi N.

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 83-99

Elsevier

Access to resources Recommend Favorite

Decidable verification for reducible timed automata specified in a first order logic with time

By Beauquier D. Slissenko

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 347-388

Elsevier

Access to resources Recommend Favorite

Relating polynomial time to constant depth

By Vollmer H.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 159-170

Elsevier

Access to resources Recommend Favorite