2009 International Conference on Computational Intelligence, Modelling and Simulation 2009
DOI: 10.1109/cssim.2009.24
|View full text |Cite
|
Sign up to set email alerts
|

Protocol Specification and Verification Using Process Algebra and Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0
1

Year Published

2013
2013
2018
2018

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 4 publications
0
3
0
1
Order By: Relevance
“…Comparing our method to other integration approaches combining Petri nets and process algebra we consider the availability of its software implementation to be a real benefit allowing for its practical utilization. We can mention its successful application in the field of communication protocols [32,33], and we believe there will be further promising areas of application after the current update.…”
Section: Discussionmentioning
confidence: 91%
“…Comparing our method to other integration approaches combining Petri nets and process algebra we consider the availability of its software implementation to be a real benefit allowing for its practical utilization. We can mention its successful application in the field of communication protocols [32,33], and we believe there will be further promising areas of application after the current update.…”
Section: Discussionmentioning
confidence: 91%
“…The evolution of a First Input First Output net can be described through the following recurrence equation [16,22,23] x…”
Section: Inference Rules For Fspnsmentioning
confidence: 99%
“…Let x l ( n ) be the epoch when the n th firing of transition t 1 begins, and let x ( n ) be the vector x ( n ) = ( x 1 ( n ), x 2 ( n ), … , x T ( n )) Consider the semi‐field ( R , ⊕, ⊗ ), where R is the real line, ⊕ denotes classical addition and ⊗ denotes maximisation. Let L be the length of the longest path without tokens in the initial marking of the net and let E be the identity matrix E=)(1em4pteεεeThe evolution of a First Input First Output net can be described through the following recurrence equation [16, 22, 23] right leftthickmathspace.5emx(n)=x(n1)A1(n)A0(n)x(nM)AM(n)A0(n)=x(n1)A1(n)x(nM)AM(n)A0(n)Here, A 0 ( n )* is defined as follows A0false(nfalse)=EA0false(nfalse)A0false(nfalse)2A0false(nfalse)L Rule 3: In the FSPNs, if a transition is fired, and if ∀ ij ∈ I ( t ), iμ(pij)wil>Th( t ), j = 1, 2 …n , then transition t is enabled. The enabled transition t is fired.…”
Section: Fspns and Degrees Of Importance And Dependencementioning
confidence: 99%
“…A primeira etapa gera como resultado a lista de linguagens escolhidas para o trabalho juntamente com as publicações clássicas das mesmas. A segunda etapa consiste na busca de publicações a respeito das linguagens escolhidas, SDL [Belina e Hogrefe 1989], LOTOS [IS8807 1988] [Chunmei et al 2010] [Ganea et al 2012, Estelle [Budkowski et al 1989], FSM [von Bochmann 1978], PROMELA e Redes de Petri [Li et al 2005] [Lee e Baik 2008] [Simonak et al 2009]. As fontes de busca foram IEEExplore e ACM Digital Library (ADL).…”
Section: Processo De Pesquisa De Linguagens De Modelagemunclassified