SCIENTIA SINICA Informationis, Volume 47 , Issue 6 : 696(2017) https://doi.org/10.1360/N112016-00056

## An approach to distinguishing the levels of free-labeled $L$-type Petri net languages in the Chomsky hierarchy

• AcceptedDec 21, 2016
• PublishedMar 6, 2017
Share
Rating

### Funded by

• Figure 7

A Petri netwhose valid incrementers and their linearerscan be fired concurrently, in which $M_0=(1,0,0,0,0)$

• Figure 8

A Petri net, three ofwhose valid incrementers and linearers canbe fired concurrently. (a) and (b) are different cases of the Petri net, in which $M_0=(1,0,0,0,0)$

• Figure 9

A Petri net, twoof whose valid incrementers and linearerscan be fired concurrently. (a)$\sim$(c) are different cases of the Petri net, in which $M_0=(1,0,0,0,0,0)$

• Figure 10

Illustrating that two valid incrementers and their linearers can be fired sequentially, intersectively, nestedly and alternatively. (a)$\sim$(e) are different cases of the Petri net, in which $M_0=(1,0,0,0,0,0)$

• Figure 11

An instance ofreachability tree. (a) $M_0=(1,0,0,0)$; (b) reachability tree

• Figure 12

An instance showing information lost in the reachability tree. (a) $M_0$ = (1; 0; 0; 0); (b) reachability tree

• Figure 13

(a) A-type and (b) B-type reachability tree for the Petri net in Figure 12(a)

• Figure 14

(a) A-type and (b) B-type reachability tree for the Petri net in Figure 5

• Figure 15

An Instance shown in reference [8]. (a) $M_0=(1,0,0,0,0,0,0)$; (b) $M_0=(1,0,0,0,0,0,0,0,0,0)$

• Figure 16

A Petri net without transitive vectors and its NMRT tree. (a) $M_0=(1,0,0,0)$; (b) B-type reachability tree; (c) NMRT tree

Citations

Altmetric