Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FSTTCS
1993
Springer

favoriteEmaildiscussreport

105views Software Engineering» more FSTTCS 1993»

Complexity Results for 1-safe Nets

13 years 8 months ago

Complexity Results for 1-safe Nets

Download www.cs.ucla.edu

We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness. 1

Allan Cheng, Javier Esparza, Jens Palsberg

Real-time Traffic

1-safe Petri Nets | Free-choice Nets | FSTTCS 1993 | Petri Nets | Software Engineering |

claim paper

Related Content

» Modelchecking counting properties of 1safe nets with buffers in paraPSPACE

» Bounded LTL Model Checking with Stable Models

» Answer Set Programming and Bounded Model Checking

» TimedArc Petri Nets vs Networks of Timed Automata

» Net Reductions for LTL ModelChecking

» Generalized loopy 2U A new algorithm for approximate inference in credal networks

» Reduction rules for resetinhibitor nets

» An algorithmic framework for network reconstruction

» Timed Petri Nets in Hybrid Systems Stability and Supervisory Control

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	FSTTCS
Authors	Allan Cheng, Javier Esparza, Jens Palsberg

Comments (0)