Author： Yen H.-C. Jian S.-T. Lao T.-P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.170, Iss.1, 1996-12, pp. : 445-464
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
Deciding bisimulation-like equivalences with finite-state processes
By Jancar
Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. :
Access to resources
Recommend
Deciding true concurrency equivalences on safe, finite nets
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
Decidability of bisimulation equivalence for normed pushdown processes
By Stirling C.
Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. :
Bisimulation for probabilistic transition systems: a coalgebraic approach
By de Vink E.P. Rutten J.J.M.M.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
Studying equivalences of transition systems with algebraic tools
By Malacaria P.
Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. :