FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1551054725> ?p ?o ?g. }

• W1551054725 abstract "Petri nets are an important formal paradigm for modeling and analysis of discrete event systems. The related areas of application of Petri nets include deadlock avoidance and prevention, supervisory control, forbidden state detection, different aspects of flexible manufacturing systems, and many others (Zhou & DiCesare, 1993; Holloway et al., 1997; Boel et al., 1995). Quite often, given a discrete-event system, the designer is interested in determining whether the system can transit from an initial state to another, target state as a result of some operations from a predefined set. In terms of Petri nets, the answer to this question is obtained as a solution of a reachability problem. The reachability problem in Petri nets is formulated as follows: for any Petri net PN, with an initial marking M0, and for some other marking M, determine whether the relation M ∈ R(PN, M0) is true, where R(PN, M0) is the reachability set of PN for its initial marking M0 (Murata, 1989). The decidability of the reachability problem has been proved for a number of restricted classes of Petri nets, and there are efficient algorithms for such classes as acyclic Petri nets, marked graphs, and others (Kodama & Murata, 1988; Caprotti et al., 1995; Kostin, 1997). It has been shown that the reachability problem is decidable for generalized Petri nets as well (Mayr, 1984). The fundamental contribution of the paper (Mayr, 1984) is in proving that the reachability problem for generalized Petri nets is decidable. However, being highly important theoretically, the practical use of the algorithm described in that paper is limited. Actually, the algorithm creates a series of so called regular constrained refined graphs, each of which is a generalization of the basic coverability tree. As the author admits, the first refined graph would enumerate the whole reachability set of the given Petri net. In practice, two different approaches are used most often to determine the reachability of a marking in Petri nets. The first approach is based on the creation and investigation of a complete or reduced reachability graph. The main drawback of this approach is a state explosion problem. A closely related technique is the use of stubborn sets. The main purpose of the stubborn sets technique is to choose, for each marking of the net, a set of transitions to fire that is large enough to preserve some desired information about the Petri net, but is as small as possible to get a significant reduction of the resulting reachability graph (Varpaaniemi, 1998). Unfortunately, generation of minimal or reduced reachability graphs in finite state systems is known to be an NP-hard problem (Peled, 1993). If Petri net has no" @default.
• W1551054725 created "2016-06-24" @default.
• W1551054725 creator A5007048028 @default.
• W1551054725 date "2008-02-01" @default.
• W1551054725 modified "2023-09-25" @default.
• W1551054725 title "Using Transition Invariants for Reachability Analysis of Petri Nets" @default.
• W1551054725 cites W1485313875 @default.
• W1551054725 cites W1486053325 @default.
• W1551054725 cites W1490850339 @default.
• W1551054725 cites W1551903405 @default.
• W1551054725 cites W1595295153 @default.
• W1551054725 cites W1605229095 @default.
• W1551054725 cites W1835708711 @default.
• W1551054725 cites W1980580719 @default.
• W1551054725 cites W1994188141 @default.
• W1551054725 cites W1996109622 @default.
• W1551054725 cites W2047139107 @default.
• W1551054725 cites W2050281466 @default.
• W1551054725 cites W2078423317 @default.
• W1551054725 cites W2083567135 @default.
• W1551054725 cites W2112594687 @default.
• W1551054725 cites W2149030441 @default.
• W1551054725 cites W2154382983 @default.
• W1551054725 cites W2154794415 @default.
• W1551054725 cites W2160374010 @default.
• W1551054725 cites W2164003033 @default.
• W1551054725 cites W2175982508 @default.
• W1551054725 cites W2795674018 @default.
• W1551054725 cites W2798385563 @default.
• W1551054725 cites W92332904 @default.
• W1551054725 doi "https://doi.org/10.5772/5328" @default.
• W1551054725 hasPublicationYear "2008" @default.
• W1551054725 type Work @default.
• W1551054725 sameAs 1551054725 @default.
• W1551054725 citedByCount "5" @default.
• W1551054725 countsByYear W15510547252014 @default.
• W1551054725 countsByYear W15510547252022 @default.
• W1551054725 countsByYear W15510547252023 @default.
• W1551054725 crossrefType "book-chapter" @default.
• W1551054725 hasAuthorship W1551054725A5007048028 @default.
• W1551054725 hasBestOaLocation W15510547251 @default.
• W1551054725 hasConcept C104317684 @default.
• W1551054725 hasConcept C136643341 @default.
• W1551054725 hasConcept C185592680 @default.
• W1551054725 hasConcept C194232998 @default.
• W1551054725 hasConcept C199360897 @default.
• W1551054725 hasConcept C38677869 @default.
• W1551054725 hasConcept C41008148 @default.
• W1551054725 hasConcept C55493867 @default.
• W1551054725 hasConcept C80444323 @default.
• W1551054725 hasConceptScore W1551054725C104317684 @default.
• W1551054725 hasConceptScore W1551054725C136643341 @default.
• W1551054725 hasConceptScore W1551054725C185592680 @default.
• W1551054725 hasConceptScore W1551054725C194232998 @default.
• W1551054725 hasConceptScore W1551054725C199360897 @default.
• W1551054725 hasConceptScore W1551054725C38677869 @default.
• W1551054725 hasConceptScore W1551054725C41008148 @default.
• W1551054725 hasConceptScore W1551054725C55493867 @default.
• W1551054725 hasConceptScore W1551054725C80444323 @default.
• W1551054725 hasLocation W15510547251 @default.
• W1551054725 hasLocation W15510547252 @default.
• W1551054725 hasOpenAccess W1551054725 @default.
• W1551054725 hasPrimaryLocation W15510547251 @default.
• W1551054725 hasRelatedWork W1548237836 @default.
• W1551054725 hasRelatedWork W1587596062 @default.
• W1551054725 hasRelatedWork W1776999661 @default.
• W1551054725 hasRelatedWork W2117268633 @default.
• W1551054725 hasRelatedWork W2139141627 @default.
• W1551054725 hasRelatedWork W2154794415 @default.
• W1551054725 hasRelatedWork W2158164655 @default.
• W1551054725 hasRelatedWork W2269563813 @default.
• W1551054725 hasRelatedWork W2398222887 @default.
• W1551054725 hasRelatedWork W2573115399 @default.
• W1551054725 isParatext "false" @default.
• W1551054725 isRetracted "false" @default.
• W1551054725 magId "1551054725" @default.
• W1551054725 workType "book-chapter" @default.