2012
DOI: 10.1504/ijsem.2012.048622
|View full text |Cite
|
Sign up to set email alerts
|

Weighted directed graph: a Petri net-based method of extraction of closed weighted directed Euler trail

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Inthissection,thebasicdefinitionsandpropertiesrelatedtoPetrinetshavebeendiscussed.The underlying structure of PNs is based on graphs. Petri nets, also known as place-transition nets (Kumawat, 2012) are directed, weighted and bipartite graphs having two kinds of nodes: places (denotedbycircles)representingtheconditionsandtransitions(denotedbybarsorrectangularboxes) representingtheevents (Murata,1989;Kumawat&Purohit,2017).Theplacesandtransitionsare associatedtoeachotherbydirectedarcs(Figure1).Notwoplacesortransitionswillbedirectly connectedbyanedge.Aninput(output)placeofatransitionhasadirectedarcfromplace(transition) toatransition(place).Tokens,denotedbyblackdotsinsideaplacecanbe0oranypositiveinteger. TheassignmentoftokenstoeachplaceisexpressedbyMarkingvector,whichtellsusthestateof thesystem.…”
Section: Preliminaries Of Petri Netsmentioning
confidence: 99%
“…Inthissection,thebasicdefinitionsandpropertiesrelatedtoPetrinetshavebeendiscussed.The underlying structure of PNs is based on graphs. Petri nets, also known as place-transition nets (Kumawat, 2012) are directed, weighted and bipartite graphs having two kinds of nodes: places (denotedbycircles)representingtheconditionsandtransitions(denotedbybarsorrectangularboxes) representingtheevents (Murata,1989;Kumawat&Purohit,2017).Theplacesandtransitionsare associatedtoeachotherbydirectedarcs(Figure1).Notwoplacesortransitionswillbedirectly connectedbyanedge.Aninput(output)placeofatransitionhasadirectedarcfromplace(transition) toatransition(place).Tokens,denotedbyblackdotsinsideaplacecanbe0oranypositiveinteger. TheassignmentoftokenstoeachplaceisexpressedbyMarkingvector,whichtellsusthestateof thesystem.…”
Section: Preliminaries Of Petri Netsmentioning
confidence: 99%
“…The execution of Petri nets cannot be determined until we have a predefined execution policy. Multiple transitions can be enabled at same point of time and any one out of them can fire because tokens can be present at more than one place at the same time so, Petri Nets are suitable for modeling concurrent, synchronous, distributed, parallel and even nondeterministic systems [17]- [18].…”
Section: Development Of Communication Subsystem Design Model Usinmentioning
confidence: 99%
“…The execution of Petri nets cannot be determined until we have a predefined execution policy. Multiple transitions can be enabled at same point of time and any one out of them can fire because tokens can be present at more than one place at the same time so, Petri Nets are suitable for modeling concurrent, synchronous, distributed, parallel and even nondeterministic systems [2,10].…”
Section: Fig 1 Petri Netmentioning
confidence: 99%
“…A transition consumes the tokens from input places equal in number to its associated weights sum of its input arcs and puts the token to the output places equal in number to its associated weights sum of its output arcs. So, tokens initially in places should be grater or equal to its associated output arcs for firing the corresponding output transitions [2]. See Fig.…”
Section: Introductionmentioning
confidence: 99%