Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

ISSN： 0178-4617

Source： Algorithmica, Vol.65, Iss.4, 2013-04, pp. : 713-753

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

SAT-Solving the Coverability Problem for Petri Nets

By Abdulla Parosh Aziz Iyer S. Purushothaman Nylén Aletta

Formal Methods in System Design, Vol. 24, Iss. 1, 2004-01 ,pp. : 25-43

Springer Publishing Company

Access to resources Recommend Favorite

On Cutwidth Parameterized by Vertex Cover

By Cygan Marek Lokshtanov Daniel Pilipczuk Marcin Pilipczuk Michał Saurabh Saket

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 940-953

Springer Publishing Company

Access to resources Recommend Favorite

Automatic generation of ladder diagram with control Petri Net

By Lee Gi Bum Zandong Han Lee Jin S.

Journal of Intelligent Manufacturing, Vol. 15, Iss. 2, 2004-04 ,pp. : 245-252

Springer Publishing Company

Access to resources Recommend Favorite

A Sufficient Condition for Reachability in a General Petri Net

By Ramachandran Parthasarathy Kamath Manjunath

Discrete Event Dynamic Systems, Vol. 14, Iss. 3, 2004-07 ,pp. : 251-266

Springer Publishing Company

Access to resources Recommend Favorite

Modeling of Manufacturing Processes Using a Petri-net Representation

By Rudas I.J. Horvath L.

Engineering Applications of Artificial Intelligence, Vol. 10, Iss. 3, 1997-06 ,pp. : 243-255

Elsevier

Access to resources Recommend Favorite