发布求助
文献互助 智能选刊 最新文献

Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)最新文献

筛选
英文 中文
Asymptotic analysis of heaps of pieces and application to timed Petri nets 块堆的渐近分析及其在定时Petri网中的应用
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796562
S. Gaubert, J. Mairesse
{"title":"Asymptotic analysis of heaps of pieces and application to timed Petri nets","authors":"S. Gaubert, J. Mairesse","doi":"10.1109/PNPM.1999.796562","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796562","url":null,"abstract":"What is the density of an infinite heap of pieces, if we let pieces fall down randomly, or if we select pieces to maximize the density? How many transitions of a safe timed Petri net can we fire per time unit? We reduce these questions to the computation of the average and optimal case Lyapunov exponents of max-plus automata, and we present several techniques to compute these exponents. First, we introduce a completed \"non-linear automaton\", which essentially fills incrementally all the gaps that can be filled in a heap without changing its asymptotic height. Using this construction, when the pieces have integer valued shapes, and when any two pieces overlap, the Lyapunov exponents can be explicitly computed. We present two other constructions (partly based on Cartier-Foata normal forms of traces) which allow us to compute the optimal case Lyapunov exponent, assuming only that the pieces have integer valued shapes.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127235169","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}
引用次数: 24
Modeling software systems with rejuvenation, restoration and checkpointing through fluid stochastic Petri nets 通过流体随机Petri网对具有恢复、恢复和检查点的软件系统建模
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796555
A. Bobbio, S. Garg, M. Gribaudo, A. Horváth, M. Sereno, M. Telek
{"title":"Modeling software systems with rejuvenation, restoration and checkpointing through fluid stochastic Petri nets","authors":"A. Bobbio, S. Garg, M. Gribaudo, A. Horváth, M. Sereno, M. Telek","doi":"10.1109/PNPM.1999.796555","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796555","url":null,"abstract":"In this paper, we present a Fluid Stochastic Petri Net (FSPN) based model which captures the behavior of aging software systems with checkpointing, rejuvenation and self-restoration, three well known techniques of software fault tolerance. The proposed FSPN based modeling framework is novel in many aspects. First, the FSPN formalism itself is extended by adding flush-out arcs. Second, the three techniques are simultaneously captured in a single model for the first time. Third, the formalism enables modeling dependencies of the three techniques on various system features such as failure, load and time in the same framework. Further, our base FSPN model can be viewed as a generalization of most previous models in the literature. We show that these FSPNs can not only mimic previously published models but can also extend them. For one FSPN model, we present numerical results to illustrate their usage in deriving measures of interest.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123749480","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}
引用次数: 37
Exploiting Petri nets to support fault tree based dependability analysis 利用Petri网支持基于故障树的可靠性分析
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796561
A. Bobbio, G. Franceschinis, R. Gaeta, L. Portinale
{"title":"Exploiting Petri nets to support fault tree based dependability analysis","authors":"A. Bobbio, G. Franceschinis, R. Gaeta, L. Portinale","doi":"10.1109/PNPM.1999.796561","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796561","url":null,"abstract":"This paper explores the possibility of converting Fault Trees (FT) into the Generalized Stochastic Petri Net (GSPN) formalism. Starting from a slightly modified version of a conversion algorithm already appeared in the literature, the aim of the paper is to exploit the modeling and decision power of GSPN for both the qualitative and the quantitative analysis of the modeled system. The qualitative analysis resorts to structural properties and is based on a T-invariant analysis. In order to alleviate the state space explosion problem deriving from the quantitative analysis, the paper proposes a new formalism for FT, that is referred to as High Level FT (HLFT), in which replicated redundant units are folded and indexed. Starting from the HLFT formalism, a new conversion algorithm is provided that translates a HLFT into a Stochastic Well-formed Net (SWN). The computational saving of using SWN with respect to GSPN is carefully examined considering an example of a fault-tolerant multiprocessor system.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128173349","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}
引用次数: 30
Performance evaluation of IEEE 802.11 wireless LANs with stochastic Petri nets 基于随机Petri网的IEEE 802.11无线局域网性能评估
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796531
R. German, A. Heindl
{"title":"Performance evaluation of IEEE 802.11 wireless LANs with stochastic Petri nets","authors":"R. German, A. Heindl","doi":"10.1109/PNPM.1999.796531","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796531","url":null,"abstract":"IEEE has recently standardized the physical layer and the medium access mechanism for wireless local area networks. This paper presents a performance study of the distributed coordination function, the fundamental contention based access mechanism. Stochastic Petri nets are used as a modeling formalism. A detailed model captures all relevant system aspects in a concise way. The detailed model is evaluated by simulation and also used to derive two more compact models which are analytically tractable. All models are used to investigate different physical layer options and the influence of several system parameters.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133569414","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}
引用次数: 41
Scenario durations characterization of t-timed Petri nets using linear logic 使用线性逻辑的t时间Petri网的场景持续时间表征
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796567
B. Pradin-Chezalviel, R. Valette, Luis Allan Künzle
{"title":"Scenario durations characterization of t-timed Petri nets using linear logic","authors":"B. Pradin-Chezalviel, R. Valette, Luis Allan Künzle","doi":"10.1109/PNPM.1999.796567","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796567","url":null,"abstract":"This paper aims to handle scenario durations of t-timed Petri nets without constructing the class graph. We use a linear logic characterization of scenarios based on the equivalence between reachability in Petri nets and provability of a class of linear logic sequents. It has been shown that it was possible to characterize a scenario with concurrency induced both by the Petri net structure and by the marking. This approach, based on the rewriting of the linear logic sequent proof, is limited because some structural concurrency cannot be expressed. In this paper we develop a new approach based on a canonical proof of the sequent. It does not explicitly characterize the scenario but it delimits its duration through an algebraic symbolic expression. It allows handling non safe or cyclic Petri nets and structures which cannot be uniquely characterized by \"sequence\" and \"parallel\" operations.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134347666","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}
引用次数: 38
Fluid stochastic Petri nets: An extended formalism to include non-Markovian models 流体随机Petri网:包含非马尔可夫模型的扩展形式
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796554
M. Gribaudo, M. Sereno, A. Bobbio
{"title":"Fluid stochastic Petri nets: An extended formalism to include non-Markovian models","authors":"M. Gribaudo, M. Sereno, A. Bobbio","doi":"10.1109/PNPM.1999.796554","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796554","url":null,"abstract":"A Fluid Stochastic Petri Net (FSPN) formalism, where there are two kind of places, one which carries discrete tokens and the other which contains continuous quantity, is presented and discussed. In the proposed formulation, a new primitive is introduced, called flush-out arc. A flush-out arc connects a transition to a continuous place and has the effect of instantaneously empty the place when the transition fires. With this extension, FSPNs can be viewed as a graphical formalism to represent stochastic models with reward rates that can be dependent on the discrete as well as the continuous component of the state space descriptor. First the model is formally introduced and the integro-differential equations representing the dynamic of the system are fully derived in the case of a single continuous place. However, the goal of the paper is to propose a first step towards the automatic solution of a general FSPN model starting from its graphical description. Furthermore, in order to illustrate the potentiality of the approach, we show that the proposed formalism is suited to convert a non-Markovian SPN, of the type considered up to now in the literature, into a FSPN. Since, however, the FSPN formalism is more general and flexible, various modeling extensions, not conceivable in the non-Markovian SPN setting, are investigated.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569331","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}
引用次数: 31
An efficient well-specified check 一种有效且明确的检查
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796559
D. Deavours, W. Sanders
{"title":"An efficient well-specified check","authors":"D. Deavours, W. Sanders","doi":"10.1109/PNPM.1999.796559","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796559","url":null,"abstract":"A long-standing problem with generalized stochastic Petri nets and extensions is that of what to do when more than one zero-timed event is scheduled to occur at the same time. If the order is left unspecified, it could lead to ambiguity that affects reward variables. Stochastic activity nets (SANs) have used the well-specified condition to avoid this problem. However, the existing algorithm to perform the well-specified check is computationally complex, proportional to the number of paths through unstable markings. We provide some theoretical results that allow us to make use of a much more efficient algorithm, with complexity proportional to the number of arcs between unstable markings.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433134","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}
引用次数: 29
Formal relation of Markov renewal theory and supplementary variables in the analysis of stochastic Petri nets 随机Petri网分析中马尔可夫更新理论与补充变量的形式关系
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796537
R. German, M. Telek
{"title":"Formal relation of Markov renewal theory and supplementary variables in the analysis of stochastic Petri nets","authors":"R. German, M. Telek","doi":"10.1109/PNPM.1999.796537","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796537","url":null,"abstract":"Non-Markovian stochastic Petri nets have been investigated mainly by means of Markov renewal theory and by the method of supplementary variables. Both approaches provide different analytic descriptions of the same system. Numerical algorithms based on these descriptions lead to similar results. Parallel research effort resulted from the fact that an exact relationship of the two was not known. In this paper such a formal relationship is established for Markov regenerative stochastic Petri nets with general preemption policies in both the transient and stationary case. As a by-product, a closed form solution in Laplace domain is derived, which is easier to apply than previously known ones. An example from communications is used for illustrations.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131030777","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}
引用次数: 22
Implicit places in net systems 网络系统中的隐式位置
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796557
F. García-Vallés, J. Colom
{"title":"Implicit places in net systems","authors":"F. García-Vallés, J. Colom","doi":"10.1109/PNPM.1999.796557","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796557","url":null,"abstract":"Implicit places are a powerful tool inside Petri net theory, used in many design phases of a system. Firstly used as a reduction rule of Petri nets, now are widely used in quantitative and qualitative analysis, synthesis of models or in fault-tolerant implementations. This paper reviews the basic definitions and results on these places, clarifying many of the previous proofs. We also present new results concerning concurrent implicit places (preserving the enabling degree of transitions). Finally, we study the characterisation of structurally implicit places and the problem of the computation of the minimal initial marking making implicit a structurally implicit place. We show that this last problem is NP-complete for live and safe free-choice systems.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122843928","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}
引用次数: 46
GSPN analysis of dual-band mobile telephony networks 双频移动电话网络的GSPN分析
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331) Pub Date : 1999-09-08 DOI: 10.1109/PNPM.1999.796534
M. Marsan, M. Meo, M. Sereno
{"title":"GSPN analysis of dual-band mobile telephony networks","authors":"M. Marsan, M. Meo, M. Sereno","doi":"10.1109/PNPM.1999.796534","DOIUrl":"https://doi.org/10.1109/PNPM.1999.796534","url":null,"abstract":"In this paper we present detailed and compact GSPN models for the performance analysis, design, and planning of cellular mobile telephony networks in which the utilization of two separate frequency bands for the provision of services to end users (like in dual-band GSM systems) complicates the cellular structure with the presence of microcells and macrocells. The flexibility of the GSPN modeling approach allows a simple construction of detailed and compact models under different assumptions as regards system parameters and resource management algorithms. This makes the performance analysis of the considered type of communication systems much simpler than with direct Markovian models, and is instrumental for careful network design and planning procedures. The presentation of numerical results derived from the GSPN models proves the viability of the proposed approach, and in a particular case allows the identification of possible system shortcomings and of their countermeasures.","PeriodicalId":283809,"journal":{"name":"Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)","volume":"46 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665295","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信