2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) 2010
DOI: 10.1109/bicta.2010.5645063
|View full text |Cite
|
Sign up to set email alerts
|

Column and Row Catenation Petri Net System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…[3,5] An Array Token Petri net Structure (ATPNS) is a five tuple N = (Σ, C, M 0 , σ, F) where Σ is a given alphabet, C = (P, T, I, O) is a Petri net structure with Arrays of Σ** in certain places of P as initial markings, M 0 : P → Σ**, σ: T →L a mapping on the set of transitions to the set of labels and a finite set of final places F P.…”
Section: Petri Net Model Generating Array Passwordsmentioning
confidence: 97%
See 2 more Smart Citations
“…[3,5] An Array Token Petri net Structure (ATPNS) is a five tuple N = (Σ, C, M 0 , σ, F) where Σ is a given alphabet, C = (P, T, I, O) is a Petri net structure with Arrays of Σ** in certain places of P as initial markings, M 0 : P → Σ**, σ: T →L a mapping on the set of transitions to the set of labels and a finite set of final places F P.…”
Section: Petri Net Model Generating Array Passwordsmentioning
confidence: 97%
“…3.1 Definition: Petri net [3,5] A Petri net structure is a four tuple C = (P, T, I, O) where P = {p 1 , p 2 ,....., p n } is a finite set of places, n ≥ 0, T = {t 1 , t 2 ,…, t m } is a finite set of transitions m ≥ 0, P∩T= Ø, I: T→P∞ is the input function from transitions to bags of places and O: T→P∞ is the output function from transitions to bags of places. [3,5] An Array Token Petri net Structure (ATPNS) is a five tuple N = (Σ, C, M 0 , σ, F) where Σ is a given alphabet, C = (P, T, I, O) is a Petri net structure with Arrays of Σ** in certain places of P as initial markings, M 0 : P → Σ**, σ: T →L a mapping on the set of transitions to the set of labels and a finite set of final places F P.…”
Section: Petri Net Model Generating Array Passwordsmentioning
confidence: 99%
See 1 more Smart Citation
“…String languages and two dimensional array languages have been discussed in detail in Formal Languages. Array language can be generated by a Petri net [5][6][7][8][9]. Tokens are rectangular or hexagonal arrays over a given alphabet.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand Petri net [5] is an abstract formal model of information flow. Motivated by the fact that Array Token Petri Net Structure (ATPNS) has been defined to generate most of the two dimensional languages generated by array grammars [6,7,8,9,10], we have tried to use ATPNS in clustering. Here we propose an algorithm to generate distorted English characters.…”
Section: Introductionmentioning
confidence: 99%