Author： Bergstra J.A. Ponse A. van der Zwaag M.B.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.309, Iss.1, 2003-12, pp. : 313-355
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
Decidability of bisimulation equivalence for normed pushdown processes
By Stirling C.
Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. :
Access to resources
Recommend
International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 11, Iss. 2, 2015-04 ,pp. :
Learning to verify branching time properties
By Vardhan Abhay Viswanathan Mahesh
Formal Methods in System Design, Vol. 31, Iss. 1, 2007-08 ,pp. :
Time–Space Tradeoffs for Branching Programs
By Beame P. Jayram T.S. Saks M.
Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. :