Author： Jategaonkar L. Meyer A.R.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.154, Iss.1, 1996-01, pp. : 107-143
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
A uniform approach to true-concurrency and interleaving semantics for Petri nets
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
A completed hierarchy of true concurrent equivalences
By Fecher H.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
Complexity results for 1-safe nets
By Cheng A. Esparza J. Palsberg J.
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :