Author： Helsen Simon
Publisher： Springer Publishing Company
ISSN： 1388-3690
Source： LISP and Symbolic Computation, Vol.17, Iss.4, 2004-12, pp. : 347-394
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Bisimilarity as a Theory of Functional Programming
By Gordon A.D.
Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Bisimilarity as a theory of functional programming
By Gordon A.D.
Theoretical Computer Science, Vol. 228, Iss. 1, 1999-10 ,pp. :
The complexity of bisimilarity-checking for one-counter processes
By Kucera A.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Undecidability of bisimilarity for Petri nets and some related problems
By Jancar P.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :