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

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

筛选
英文 中文
Computational algorithms for product form solution stochastic Petri nets 乘积形式解随机Petri网的计算算法
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393431
M. Sereno, G. Balbo
{"title":"Computational algorithms for product form solution stochastic Petri nets","authors":"M. Sereno, G. Balbo","doi":"10.1109/PNPM.1993.393431","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393431","url":null,"abstract":"It is shown that the steady-state probability distribution of stochastic Petri nets (SPNs) with product form solution can be efficiently computed using an algorithm whose space and time complexities are polynomial in the number of places and in the number of tokens in the initial marking of the SPN. Basic to the derivation of such an algorithm is a product form solution criterion proposed by J. L. Coleman et al. (1992). The algorithm relies on the derivation of a recursive expression of the normalization constant that is a generalization of that derived by J. P. Buzen (1973) for multiple class product form queuing networks with load independent service centers.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965363","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}
引用次数: 32
A general iterative technique for approximate throughput computation of stochastic marked graphs 随机标记图近似吞吐量计算的一般迭代技术
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393427
J. Campos, J. Colom, H. Jungnitz, M. Suárez
{"title":"A general iterative technique for approximate throughput computation of stochastic marked graphs","authors":"J. Campos, J. Colom, H. Jungnitz, M. Suárez","doi":"10.1109/PNPM.1993.393427","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393427","url":null,"abstract":"A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behavior of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore, the analysis of otherwise intractable systems is possible.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"373 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884544","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
The implications of industrial systems' complexity on methodologies for system design and evaluation 工业系统的复杂性对系统设计和评估方法的影响
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393451
E. Schmitter
{"title":"The implications of industrial systems' complexity on methodologies for system design and evaluation","authors":"E. Schmitter","doi":"10.1109/PNPM.1993.393451","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393451","url":null,"abstract":"Industrial systems become more and more complex and a lot of implications can be identified which generally influence system design and development. These implications are discussed based on experiences in system modeling and demonstrated by industrial applications. This results in the concept of a methodology which is described by different aspects of system modeling and by the features of the modeling tool TOMSPIN used within product developments. Known limitations offer the potential evolution of current methods and motivate future work on improving system development and system evaluation.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132719716","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}
引用次数: 1
Definition of the model-"Stochastic timed well formed coloured nets" 模型的定义-“随机定时良好形成的彩色网”
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393438
Y. Atamna
{"title":"Definition of the model-\"Stochastic timed well formed coloured nets\"","authors":"Y. Atamna","doi":"10.1109/PNPM.1993.393438","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393438","url":null,"abstract":"A model able to deal with the main characteristics of the real-time distributed systems (complex systems with a big number of components; systems with a lot of different time characteristics and, in particular, time constraints) is defined. The stochastic timed well-formed colored nets (STWN model) are based on two underlying models: the well-formed colored nets (WN) which provide both a concise and a structured representation and are well adapted for representing big systems composed of sets of components with a common behavior, and the stochastic timed Petri nets (STPN model) which have the ability to deal with combinations of arbitrary distribution (exponential, deterministic (time 0 and /spl plusmn/ 0), uniform and mixed) and are well adapted for representing systems with time constraints (time critical systems). The analysis of the dynamic behavior of an STWN model is based on an object called the randomized symbolic state graph, which is an aggregated semi-Markov process which allows a lot of performance evaluations. Simple and illustrative examples showing the advantage of the STWN model are presented.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134000749","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}
引用次数: 8
A methodology for formal expression of hierarchy in model solution 模型解中层次结构的形式化表达方法
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393445
M. Malhotra, Kishor S. Trivedi
{"title":"A methodology for formal expression of hierarchy in model solution","authors":"M. Malhotra, Kishor S. Trivedi","doi":"10.1109/PNPM.1993.393445","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393445","url":null,"abstract":"A methodology for formal specification of hierarchy both in model specification and model solution is presented. Hierarchy is allowed to exist among different model types used in performance and dependability modeling. This offers a lot of flexibility and power to the modeler. The methodology presents a unified view of a variety of modeling techniques such as hierarchical composition, behavioral decomposition, iterative hierarchical modeling, reward-based performability modeling, aggregation, etc. This methodology brings the hierarchical modeling technique(s), based on which the model is constructed, to the fore. The results in a better understanding of the model by the user and it can simplify model validation if need be. Such a methodology would also make the design of modeling toolkits, which allow these modeling techniques, much simpler by presenting a conceptually simpler and unified view of a variety of modeling techniques. The formal expression is also expected to assist the modeler in construction of large, complex models.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"101 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120970652","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}
引用次数: 25
Fast simulation of rare events in stochastic Petri nets 随机Petri网中罕见事件的快速模拟
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393447
J. Dunkel
{"title":"Fast simulation of rare events in stochastic Petri nets","authors":"J. Dunkel","doi":"10.1109/PNPM.1993.393447","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393447","url":null,"abstract":"It is shown how variance reduction techniques can be used simulating rare events in stochastic Petri nets. The application of fast simulation methods is illustrated for several classes of stochastic Petri nets: GSPNs, deterministic and stochastic Petri nets, and Petri nets with generally distributed firing times are studied. For the latter case, different state change policies such as resampling and age memory are distinguished. Some experiments show the usefulness of this approach.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969200","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}
引用次数: 1
Operational analysis of timed Petri nets and application to the computation of performance bounds 时间Petri网的运算分析及其在性能界计算中的应用
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393428
G. Chiola, C. Anglano, J. Campos, J. Colom, M. Suárez
{"title":"Operational analysis of timed Petri nets and application to the computation of performance bounds","authors":"G. Chiola, C. Anglano, J. Campos, J. Colom, M. Suárez","doi":"10.1109/PNPM.1993.393428","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393428","url":null,"abstract":"Operational analysis techniques are used to partially characterize the behavior of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queuing network models. An interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions is shown. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular, the extension to well-formed colored nets appears straightforward and allows an efficient exploitation of model symmetries.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123737487","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}
引用次数: 50
Aggregation and reduction techniques for hierarchical GCSPNs 分层gcspn的聚合和约简技术
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393449
P. Buchholz
{"title":"Aggregation and reduction techniques for hierarchical GCSPNs","authors":"P. Buchholz","doi":"10.1109/PNPM.1993.393449","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393449","url":null,"abstract":"The classes of stochastic well-formed colored nets (SWNs) and hierarchical generalized colored stochastic Petri nets (HGCSPNs) have been recently introduced for the specification and analysis of complex systems. SWNs allow the specification of models including symmetries in a very compact way and additionally can be used to generate a reduced Markov chain (MC) from the net specification by exploiting symmetries in the model. HGCSPNs allow a modular specification of a net using several smaller parts. This decomposition of the net specification can also be used to handle the state explosion of the underlying MC by describing the generator matrix using only much smaller subnet matrices. The author combines SWNs and HGCSPNs, allowing the automatic generation of a reduced MC from the hierarchical net specification. Approximative aggregation techniques for hierarchical nets are introduced.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123832375","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
Decidability of the strict reachability problem for TPN's with rational and real durations 具有合理和真实工期的TPN严格可达性问题的可判定性
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393435
V. V. Ruiz, David de Frutos-Escrig, Fernando Cuartero Gómez
{"title":"Decidability of the strict reachability problem for TPN's with rational and real durations","authors":"V. V. Ruiz, David de Frutos-Escrig, Fernando Cuartero Gómez","doi":"10.1109/PNPM.1993.393435","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393435","url":null,"abstract":"Timed Petri nets with rational and real durations are introduced. A timed version of the reachability problem, the strict reachability problem, which imposes a time limit to reach the given marking, is presented. It is shown that both in the case of rational durations, and in that of real durations, this strict reachability problem is decidable. In the first case, the result is obtained by scaling the time of the net, in such a way that all the durations of the transitions become integer. A previous result of the authors, showing that the strict reachability problem is decidable for this kind of net, is applied in order to conclude the desired result. Nevertheless, it is important to note that this application is not immediate, since, even though after scaling one can suppose that all the durations are integer, time is no more discrete, and thus the firing of a transition can happen at any (rational) moment. In the second case, a completely different approach is needed, since in general real durations cannot be normalized into integer durations. This consists of the counting of the passing of time in a symbolic way, and the simulation of the evolution of the original net without preserving the temporal order between the firing of the transitions, but only the causal order between them.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116852013","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}
引用次数: 12
A characterization of independence for competing Markov chains with applications to stochastic Petri nets 竞争马尔可夫链的独立性表征及其在随机Petri网中的应用
Proceedings of 5th International Workshop on Petri Nets and Performance Models Pub Date : 1993-10-19 DOI: 10.1109/PNPM.1993.393429
R. Boucherie
{"title":"A characterization of independence for competing Markov chains with applications to stochastic Petri nets","authors":"R. Boucherie","doi":"10.1109/PNPM.1993.393429","DOIUrl":"https://doi.org/10.1109/PNPM.1993.393429","url":null,"abstract":"It is shown that recently obtained product form results for stochastic Petri nets can immediately be obtained as a special case of a simple exclusion mechanism for the product process of a collection of Markov chains. The model is described, and several examples of exclusion/competition mechanisms that can be modeled in the framework of this paper are given.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"158 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120867895","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}
引用次数: 100
首页 上一页 下一页 尾页
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学术官方微信