Author： Fecher H.
Publisher： Elsevier
ISSN： 0020-0190
Source： Information Processing Letters, Vol.89, Iss.5, 2004-03, pp. : 261-265
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On logical and concurrent equivalences
By Bradfield J.C. Froschle S.B.
Electronic Notes in Theoretical Computer Science, Vol. 52, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Deciding true concurrency equivalences on safe, finite nets
Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. :
On the decidability of process equivalences for the -calculus
By Dam M.
Theoretical Computer Science, Vol. 183, Iss. 2, 1997-09 ,pp. :
Reducing NFAs by invariant equivalences
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Open maps, behavioural equivalences, and congruences
Theoretical Computer Science, Vol. 190, Iss. 1, 1998-01 ,pp. :