Sciweavers

    TCS
    1998
    96views Theoretical Computer Science» more  TCS 1998»

    Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete

    13 years 10 months ago
    Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
    Download  reference.kfupm.edu.sa
    The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.
    Javier Esparza
    claim paper
    Related Content
    Added 23 Dec 2010
    Updated 23 Dec 2010
    Type Journal
    Year 1998
    Where TCS
    Authors Javier Esparza
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.