作者: Markus Lindqvist
关键词: Reachability 、 Parameterized complexity 、 Petri net 、 Discrete mathematics 、 Predicate transition 、 Computer science 、 Predicate (mathematical logic) 、 Formalism (philosophy of mathematics) 、 Combinatorics 、 Stochastic Petri net
摘要: Elaboration of reachability analysis in the context Predicate/Transition nets is studied. For this purpose, parameters are introduced into markings nets. These represent any fixed individual values potentially appearing marking. The formalism for dealing with parameterized developed and dynamics augmented to cope parameters. used define trees an algorithm generating them presented. They shown be significantly smaller than ordinary contain corresponding information: from one tree several instances can derived.