Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89最新文献_第2页

Petri net modeling-the past, the present, and the future Petri网模型——过去、现在和未来

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68534

Michael K. Molloy

引用次数: 13

Stochastic Petri net modeling of VAXcluster system availability VAXcluster系统可用性的随机Petri网建模

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68545

O. Ibe, A. Sathaye, R. C. Howe, Kishor S. Trivedi

引用次数: 34

Performability analysis of parallel and distributed algorithms 并行和分布式算法的性能分析

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68557

H. Ammar, S. Islam, S. Deng

引用次数: 16

Automated construction of compound Markov chains from generalized stochastic high-level Petri nets 基于广义随机高阶Petri网的复合马尔可夫链自动构造

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68543

J.A. Carasco

引用次数: 5

The cost of eliminating vanishing markings from generalized stochastic Petri nets 广义随机Petri网消去消失标记的代价

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68542

A. Blakemore

引用次数: 25

A class of Petri nets and a reachability problem solvable in deterministic polynomial time 一类Petri网和在确定多项式时间内可解的可达性问题

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68559

Keiko Nakamura, Kiyohiko Nakamura, A. Ichikawa

引用次数: 1

GSPN models of multiserver multiqueue systems 多服务器多队列系统的GSPN模型

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68536

M. Marsan, S. Donatelli, F. Neri

引用次数: 19

Reduced base model construction methods for stochastic activity networks 随机活动网络的简化基模型构建方法

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68541

W. Sanders, J. F. Meyer

{"title":"Reduced base model construction methods for stochastic activity networks","authors":"W. Sanders, J. F. Meyer","doi":"10.1109/PNPM.1989.68541","DOIUrl":"https://doi.org/10.1109/PNPM.1989.68541","url":null,"abstract":"Several model classes for system evaluation exist and are capable of representing the kind of complex behavior exhibited by contemporary distributed computer architectures and computer-communication networks. However, a number of problems associated with the evaluation of large-scale systems arise because of the size and complexity of the stochastic process derived from the underlying net model, which serves as a 'base model' for subsequent solution of the measures in question. If this base model is constructed by standard means, e.g. it is identified with the marking behavior of the net, traditional methods of solution quickly become intractable for large systems, limiting their application to systems of only moderate complexity. This problem is addressed in the stochastic activity networks (SANs) by developing base model construction methods that account for symmetries in SAN structure and are tailored to the variable in question (e.g. response time, time to failure, etc.). It is found that such a technique can yield dramatic reductions in state-space size while preserving stochastic properties required for practical means of solution. This technique permits direct construction of a reduced base model, thus avoiding size limitations associated with more traditional approaches to model amplification.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111061","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}

引用次数: 255

Legal firing sequence and related problems of Petri nets Petri网的合法发射顺序及相关问题

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68561

Toshimasa Watanabe, Y. Mizobata, K. Onaga

引用次数: 43

Performance evaluation using unbounded timed Petri nets 利用无界时间Petri网进行性能评价

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI: 10.1109/PNPM.1989.68551

W. M. Zuberek

引用次数: 23