Sciweavers

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

17

COCOON
2003
Springer

favoriteEmaildiscussreport

159views Combinatorics» more COCOON 2003»

Petri Nets with Simple Circuits

13 years 9 months ago

Petri Nets with Simple Circuits

Download cc.ee.ntu.edu.tw

We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conﬂict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.

Hsu-Chun Yen, Lien-Po Yu

Real-time Traffic

COCOON 2003 | Normal Petri Nets | Petri Nets | Simple-circuit Petri Nets |

claim paper

Related Content

» A structural encoding technique for the synthesis of asynchronous circuits

» How Expressive Are Petri Net Schemata

» Hardware implementation of a fuzzy Petri net based on VLSI digital circuits

» Synthesis of Asynchronous Hardware from Petri Nets

» Improved Decomposition of STGs

» The Case for Analog Circuit Verification

» A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

» Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets

» Petri net modeling of gate and interconnect delays for power estimation

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	COCOON
Authors	Hsu-Chun Yen, Lien-Po Yu

Comments (0)