2008 4th International Conference on Wireless Communications, Networking and Mobile Computing 2008
DOI: 10.1109/wicom.2008.2839
|View full text |Cite
|
Sign up to set email alerts
|

A Petri Net Theory-Based Method for Modeling Web Service-Based Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
3
0
9

Year Published

2010
2010
2013
2013

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 14 publications
0
3
0
9
Order By: Relevance
“…Marking M i is called reachable from marking M if there is a sequence of transitions firings which transform M into [Han et al, 2008].…”
Section: Petri Netmentioning
confidence: 99%
See 2 more Smart Citations
“…Marking M i is called reachable from marking M if there is a sequence of transitions firings which transform M into [Han et al, 2008].…”
Section: Petri Netmentioning
confidence: 99%
“…it can progress through some firing sequences. From a marking M 0 , it can be deadlock-free immediately, yet it can have a sequence of firings which can lead the PN to a deadlock situation [Han et al, 2008]. For this reason, different levels of liveness for transition t, and marking M 0 , can be considered.…”
Section: Petri Netmentioning
confidence: 99%
See 1 more Smart Citation
“…Uma rede é dita segura se ela é 1-limitada, ou seja, 1 para todos lugares da rede (HAN, et al, 2008) (ZURAWSKI e ZHOU , 1994).…”
Section: Limitabilidade E Segurançaunclassified
“…A Figura (8) ilustra os principais elementos da RdP L/T apresentada nesta seção. 1989;LI;ZHOU, 2008;ZURAWSKI;ZHOU, 1994;YOO;JEONG;CHO, 2010;HAN et al, 2008;XU et al, 2007), istoé, Mé a marcação da rede, onde M = m p 1 , m p 2 , ..., m pr (r ∈ N * )é definida pelo vetor das marcações de cada lugar p i contendo o número de marcas e M 0é a marcação inicial.…”
Section: Production Flow Schemaunclassified