Proceedings 9th International Workshop on Petri Nets and Performance Models最新文献

Efficient solution of GSPNs using canonical matrix diagrams 用规范矩阵图求解gspn的有效方法

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953360

A. Miner

引用次数: 53

Fluid stochastic Petri nets augmented with flush-out arcs: a transient analysis technique 带冲刷弧的流体随机Petri网:一种瞬态分析技术

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953364

M. Gribaudo, A. Horváth

引用次数: 30

Equivalence and aggregation of GSPNs with labeled transitions 带标记跃迁的gspn的等价与聚合

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953368

P. Buchholz

{"title":"Equivalence and aggregation of GSPNs with labeled transitions","authors":"P. Buchholz","doi":"10.1109/PNPM.2001.953368","DOIUrl":"https://doi.org/10.1109/PNPM.2001.953368","url":null,"abstract":"Equivalence is a basic concept in many modeling formalisms to compare different realizations of a system or to compute for a given system a minimal equivalent representation. We present two different equivalence relations for a class of generalized stochastic Petri nets (GSPNs) with labeled transitions (LGSPNs), namely trace equivalence and bisimulation equivalence. In contrast to most other approaches we allow labeling of timed and immediate transitions and thus have to define equivalence for a stochastic process with exponentially timed and immediate transitions. For this class of GSPNs it is possible to compose nets via timed and immediate transitions which has also been introduced for superposed generalized stochastic Petri nets (SGSPNs). We describe under which conditions the proposed equivalences are congruences according to the composition of nets. The congruence condition is easily to achieve for timed transitions but it is shown that some additional restrictions are necessary to obtain a congruence relation which is preserved under composition via immediate transitions. However, if such a congruence is defined, then component state spaces can be reduced by aggregation before composition. This aggregation includes an elimination of some immediate transitions in LGSPNs composed via immediate transitions which has not been considered yet.","PeriodicalId":364695,"journal":{"name":"Proceedings 9th International Workshop on Petri Nets and Performance Models","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126188619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Petri net based performance evaluation of USAIA's bandwidth partitioning for the wireless cell level 基于Petri网的USAIA无线小区级带宽划分性能评估

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953355

D. Tutsch, J. Sokol

引用次数: 5

Dependability assessment of an industrial Programmable Logic Controller via Parametric Fault-Tree and High Level Petri net 基于参数故障树和高级Petri网的工业可编程控制器可靠性评估

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953353

A. Bobbio, G. Franceschinis, R. Gaeta, L. Portinale

{"title":"Dependability assessment of an industrial Programmable Logic Controller via Parametric Fault-Tree and High Level Petri net","authors":"A. Bobbio, G. Franceschinis, R. Gaeta, L. Portinale","doi":"10.1109/PNPM.2001.953353","DOIUrl":"https://doi.org/10.1109/PNPM.2001.953353","url":null,"abstract":"The case-study presented in this paper is aimed at assessing the dependability of a Programmable Logic Controller (PLC) devoted to safety functions. This case study has been brought to our attention by a national environmental agency and has been partially abstracted and anonymized to protect proprietary information. The PLC consists of a triplicated channel with a (2:3) majority voting logic and is modeled by means of a recently proposed extension of the classical Fault Tree (FT) formalism called Parametric Fault Tree (PFT). In the PFT replicated units are folded and parameterized so that only one representative of the various similar replicas is explicitly included in the model. The quantitative analysis of the PFT assumes s-independence among components and is based on combinatorial formulas. In order to include dependencies both in the failure and repair process, the PFT is directly converted into a particular class of High Level Petri Nets, called SWN. The paper illustrates the PFT formalism and the automatic conversion algorithm from a PFT into a SWN Moreover, it is shown how various kind of dependencies can be accommodated in the obtained SWN model.","PeriodicalId":364695,"journal":{"name":"Proceedings 9th International Workshop on Petri Nets and Performance Models","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130711851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Mobius: framework and atomic models Mobius:框架和原子模型

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953374

D. Deavours, W. Sanders

引用次数: 27

Simulation based performance analysis of web servers 基于仿真的web服务器性能分析

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953356

L. Wells, S. Christensen, L. Kristensen, K. Mortensen

引用次数: 51

What a structural world [structural decomposition] 多么结构性的世界[结构性分解]

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953351

G. Ciardo

{"title":"What a structural world [structural decomposition]","authors":"G. Ciardo","doi":"10.1109/PNPM.2001.953351","DOIUrl":"https://doi.org/10.1109/PNPM.2001.953351","url":null,"abstract":"Petri nets and stochastic Petri nets have been widely adopted as one of the best tools to model the logical and timing behavior of discrete-state systems. However, their practical applicability is limited by the state-space explosion problem. We survey some of the techniques that have been used to cope with large state spaces, starting from early explicit methods, which require data structures of size proportional to the number of states or state-to-state transitions, then moving to implicit methods, which borrow ideas from symbolic model checking (binary decision diagrams) and numerical linear algebra (Kronecker operators) to drastically reduce the computational requirements. Next, we describe the structural decomposition approach which has been the topic of our research in the last few years. This method only requires to specify a partition of the places in the net and, combining decision diagrams and Kronecker operators with the new concepts of event locality and node saturation, achieves fundamental gains in both memory and time efficiency. At the same, the approach is applicable to a wide range of models. We conclude by considering several research directions that could further push the range of solvable models, eventually leading to an even greater industrial acceptance of this simple yet powerful modeling formalism.","PeriodicalId":364695,"journal":{"name":"Proceedings 9th International Workshop on Petri Nets and Performance Models","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123841982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Concurrent generalized Petri nets: regenerative conditions 并发广义Petri网:再生条件

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953362

Simona Bernardi, G. Balbo

{"title":"Concurrent generalized Petri nets: regenerative conditions","authors":"Simona Bernardi, G. Balbo","doi":"10.1109/PNPM.2001.953362","DOIUrl":"https://doi.org/10.1109/PNPM.2001.953362","url":null,"abstract":"Concurrent generalized Petri nets (CGPNs) are a subclass of Markov regenerative stochastic Petri nets, characterized by timed transitions with general distributed firing times (GEN transitions), that become enabled simultaneously while no other GEN transitions can be activated during their enabling periods. In their original definition, CGPNs were identified through a study of their state space; hence they are recognized only after the construction of their tangible reachability graphs. In this paper, we present sufficient conditions representing a first step in the definition of an alternative method for the characterization of this type of models. The method is based on the structural analysis of the net, it does not require the generation of its tangible reachability graph, and is thus computationally convenient. Moreover, an advantage of this method is that it can also be applied in the case of models characterized by large state spaces, and is hence prone to be analysed via simulation using regenerative techniques. The criteria that we propose represent the basis for a preliminary analysis of the model in order to verify its membership of the class of CGPNs whose numerical solution always requires the construction of the tangible reachability graph and the characterization of the underlying Markov regenerative process.","PeriodicalId":364695,"journal":{"name":"Proceedings 9th International Workshop on Petri Nets and Performance Models","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A reachability graph construction algorithm based on canonical transition firing count vectors 一种基于正则跃迁发射计数向量的可达性图构建算法

Proceedings 9th International Workshop on Petri Nets and Performance Models Pub Date : 2001-09-11 DOI: 10.1109/PNPM.2001.953361

G. Chiola, R. Carvajal-Schiaffino

引用次数: 3