Parameterized reachability trees for predicate/transition nets

作者: Markus Lindqvist

DOI: 10.1007/3-540-56689-9_49

关键词: ReachabilityParameterized complexityPetri netDiscrete mathematicsPredicate transitionComputer sciencePredicate (mathematical logic)Formalism (philosophy of mathematics)CombinatoricsStochastic 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.

参考文章(10)
Wolfgang Reisig, A strong part of concurrency applications and theory of petri nets. pp. 238- 272 ,(1986) , 10.1007/3-540-18086-9_29
G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad, On Well-Formed Coloured Nets and Their Symbolic Reachability Graph Springer Berlin Heidelberg. pp. 373- 396 ,(1991) , 10.1007/978-3-642-84524-6_13
Richard Char-Tung Lee, Chin-Liang Chang, Symbolic Logic and Mechanical Theorem Proving ,(1973)
C. Dutheillet, S. Haddad, Regular stochastic Petri nets applications and theory of petri nets. pp. 186- 209 ,(1991) , 10.1007/3-540-53863-1_26
Peter Huber, Arne M. Jensen, Leif O. Jepsen, Kurt Jensen, Reachability trees for high-level petri nets Theoretical Computer Science. ,vol. 45, pp. 261- 292 ,(1986) , 10.1016/0304-3975(86)90046-0
Wolfgang Reisig, Petri Nets: An Introduction ,(1985)
H. J. Genrich, Predicate/transition nets Advances in Petri nets 1986, part I on Petri nets: central models and their properties. pp. 207- 247 ,(1987) , 10.1007/978-3-642-84524-6_1
Chen Chung Chang, Howard Jerome Keisler, Model Theory ,(1966)