2004
DOI: 10.1016/j.laa.2004.02.015
|View full text |Cite
|
Sign up to set email alerts
|

Aggregation of stochastic automata networks with replicas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 30 publications
(36 citation statements)
references
References 15 publications
0
36
0
Order By: Relevance
“…see the recent papers [9,14,2,20]). This is specially true in performance evaluation, where various modelling formalisms (e.g.…”
Section: Lemma 21mentioning
confidence: 99%
“…see the recent papers [9,14,2,20]). This is specially true in performance evaluation, where various modelling formalisms (e.g.…”
Section: Lemma 21mentioning
confidence: 99%
“…1 (2) e2(π2) e5 1 presents a SAN model with two automata, four local events, one synchronizing event, and one functional rate. In the context of this paper, we will use roman letters to identify the name of events and functions, and greek letters to describe constant values of rates and probabilities.…”
Section: Stochastic Automata Networkmentioning
confidence: 99%
“…The modular approach allowed by SAN brings further advantages that lie not only in the size of the models that can be analyzed, if compared to MC, but also in the possibility of stepwise representing aspects of the reality of interest and analyzing the numerical results associated [8,2]. In fact, the use of the SAN formalism attenuates the state space problem by furnishing efficient numerical methods to compute performance indices.…”
Section: Introductionmentioning
confidence: 99%
“…If automaton A (1) is in state 1 (1) , the transition from state 0 (2) to 1 (2) does not occur (rate equal to 0). Using the SAN notation employed by the software tool PEPS2003 [3], the expression of this function is:…”
Section: San -Stochastic Automata Networkmentioning
confidence: 99%
“…The use of functional transitions is a powerful primitive of the SAN formalism, since it allows to describe very complex behaviors in a very compact format. The computational costs to handle functional rates has decreased significantly with the developments of numerical solutions for SAN models, e.g., the algorithms for generalized tensor products [2,5]. Table 2.…”
Section: San -Stochastic Automata Networkmentioning
confidence: 99%