On the complexity of deadlock detection in families of planar nets

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.215, Iss.1, 1999-02, pp. : 225-237

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity Results on Learning by Neural Nets

By Lin J-H.

Machine Learning, Vol. 06, Iss. 3, 1991-05 ,pp. : 211-230

Springer Publishing Company

Access to resources Recommend Favorite

Complexity results for 1-safe nets

By Cheng A. Esparza J. Palsberg J.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 117-136

Elsevier

Access to resources Recommend Favorite

An empirical evaluation of deadlock detection in software architecture specifications

By Tsai J.J.P. Xu K.

Annals of Software Engineering, Vol. 7, Iss. 1-4, 1999-01 ,pp. : 95-126

Springer Publishing Company

Access to resources Recommend Favorite

Extended elementary siphon-based deadlock prevention policy for a class of generalised Petri nets

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 1, 2014-01 ,pp. : 85-102

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient search of Petri Nets for deadlock-free scheduling in FMSs using heuristic functions

By ELMEKKAWY TAREK Y. ELMARAGHY HODA A.

International Journal of Computer Integrated Manufacturing, Vol. 16, Iss. 1, 2003-01 ,pp. : 14-24

Taylor & Francis Ltd

Access to resources Recommend Favorite