![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Ibarra O.H. Dang Z.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 687-706
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Reachability and the power of local ordering
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The power of reachability testing for timed automata
By Aceto L. Bouyer P. Burgueno A. Larsen K.G.
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)