Parameterized Reachability Trees for Algebraic Petri Nets
作者： Karsten Schmidt
关键词: Parameterized complexity 、 Predicate (grammar) 、 Stochastic Petri net 、 Algebraic petri nets 、 Algebraic number 、 Petri net 、 Discrete mathematics 、 Reachability 、 Computer science
摘要: Parameterized reachability trees have been proposed by M. Lindquist for predicate/transition nets. We discuss the application of this concept to algebraic For purpose a modification several definitions is necessary due different net descriptions, transition rules and theoretical backgrounds. That's why we present from bottom Furthermore combination parameterized analysis with well known stubborn set method.
springer.com
sci-hub.st 参考文章(8)
Hartmut Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1 ,(1985)
P. H. Starke, Reachability analysis of Petri nets using symmetries Systems Analysis Modelling Simulation. ,vol. 8, pp. 293- 303 ,(1991)
Peter Huber, Arne M. Jensen, Leif O. Jepsen, Kurt Jensen, Towards reachability trees for high-level Petri nets applications and theory of petri nets. pp. 215- 233 ,(1985) , 10.1007/3-540-15204-0_13
Wolfgang Reisig, Petri nets and algebraic specifications Theoretical Computer Science. ,vol. 80, pp. 1- 34 ,(1991) , 10.1016/0304-3975(91)90203-E
Kurt Jensen, Coloured petri nets and the invariant-method Theoretical Computer Science. ,vol. 14, pp. 317- 336 ,(1981) , 10.1016/0304-3975(81)90049-9
Markus Lindqvist, Parameterized reachability trees for predicate/transition nets applications and theory of petri nets. pp. 1- 120 ,(1991) , 10.1007/3-540-56689-9_49
M. Tiusanen, Symbolic, symmetry, and stubborn set searches Lecture Notes in Computer Science. ,vol. 815, pp. 510- 530 ,(1994)
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