Reachability in live and safe free-choice Petri nets is NP-complete

By Esparza J.  

Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. : 211-224

Elsevier

Access to resources Recommend Favorite

State Estimation of λ-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*

By Giua Alessandro   Corona Daniele   Seatzu Carla  

Discrete Event Dynamic Systems, Vol. 15, Iss. 1, 2005-03 ,pp. : 85-108

Springer Publishing Company

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

Deadlock-free verification and performance enhancement of RosettaNet PIPs with time Petri nets

By Liao Da-Yin   Liu Paladin  

International Journal of Computer Integrated Manufacturing, Vol. 18, Iss. 2-3, 2005-03 ,pp. : 199-209

Taylor & Francis Ltd

Access to resources Recommend Favorite

Extremal problems for convex polygons

By Audet Charles   Hansen Pierre   Messine Frédéric  

Journal of Global Optimization, Vol. 38, Iss. 2, 2007-06 ,pp. : 163-179

Springer Publishing Company

Access to resources Recommend Favorite