DePetri net thery an its appicatins NTUepetri网络理论及其应用——南洋理工大学.ppt

Context-freeness of PN Languages Decidable for unlabelled Petri nets `The Context-Freeness of the Languages Associated with Vector Addition Systems is Decidable ‘ [Schwer’92]. No complexity analysis * Deterministic Petri Nets Deterministic Petri net: for every reachable marking of a PN Known result (Pelz, STACS 1987) The language equivalence problem for deterministically labeled Petri nets is decidable. (Notice that the problem is undecidable for general PNs.) * Iterating systems Given a loop (q, ω) does there exist an infinite number of paths q with loop value ω … * Pumping lemma for VASSs Iterating system w.r.t. Loop (q, ω): μ0 μ1 μ2 μ3 μp q σ1 σ2 σ3 σp ω ω1 ω2 ω3 ωp+1 (↑↑-↑-↑) (↑↓-↑↑-) (↑↑-↓↓↑) (↑↓-↑↓↑) (↓↓-↓↓↓) * PART 6: Applications of Petri Net Theory * Applications of Petri Net Theory Membrane Computing Supervisory Control Computer-Aided Verification / Formal Methods Asynchronous Circuit Design/Analysis … * Application to Membrane Computing Membrane Computing (MC) -- branch of molecular computing initiated by Gheorghe P aun in [TUCS Research Report 1998], [JCSS 2000] MC identifies an unconventional computing model, called P system -- abstracts from the way living cells process chemical compounds in their `compartmental (membrane) structure. A P system consists of a finite number of membranes, each of which contain multisets of objects (symbols) which change during the computation. * Membrane Computing Membranes organized as Venn diagram/tree structure, where one membrane may contain other membranes. Dynamics of the system is governed by a set of rules associated with each membrane. Rules specifies how objects evolve/move into neighboring membranes; how membranes can be dissolved/divided/created. Rules used in nondeterministic, maximally parallel manner define transitions between configurations. A P system can be used as: acceptor of configurations, or generator of configurations (from a fixed init