A complexity analysis of bisimilarity for value-passing processes

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.238, Iss.1, 2000-05, pp. : 313-345

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

The complexity of bisimilarity-checking for one-counter processes

By Kucera A.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 157-183

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

Appreciating the complexity of organizational processes

By Espejo Raul Kuropatwa Daniel

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 40, Iss. 3-4, 2011-05 ,pp. : 454-476

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Bisimilarity as a Theory of Functional Programming

By Gordon A.D.

Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. : 1-21

Elsevier

Access to resources Recommend Favorite

Bisimilarity for the Region Calculus

By Helsen Simon

LISP and Symbolic Computation, Vol. 17, Iss. 4, 2004-12 ,pp. : 347-394

Springer Publishing Company

Access to resources Recommend Favorite