首页 > 最新文献

Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.最新文献

英文 中文
Intelligent simulation for the estimation of the uplink outage probabilities in CDMA networks CDMA网络中上行链路中断概率估计的智能仿真
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167718
F. Vázquez-Abad, I. Baltcheva
In CDMA mobile networks, callers that are transmitting through a power station may cause interference at other power stations. When many users are already connected in the network, a new call may cause the signal to noise ratio to drop below a tolerance threshold. This phenomenon is called 'outage' and it provides an important measure of performance, useful in the design and control of the system. Evaluating this probability analytically has proven unsuccessful and only approximations exist today. Direct simulation of such networks is at present very slow because outage occurs infrequently - it may take hours to simulate directly a realistic model if a reasonable precision is desired. Thus this approach is not useful for design problems where one wishes to evaluate and compare performance of many different network models. In this work we implement a change of measure to estimate the outage probability using importance sampling. We present a functional estimator and a stochastic approximation method that are capable of learning the best parameters for the change of measure.
在CDMA移动网络中,通过一个电站进行传输的呼叫者可能会对其他电站造成干扰。当网络中已经连接了许多用户时,一个新的呼叫可能会导致信噪比下降到容限阈值以下。这种现象被称为“中断”,它提供了一个重要的性能衡量标准,在系统的设计和控制中很有用。对这一概率进行分析评估已被证明是不成功的,目前只存在近似值。这种网络的直接模拟目前非常缓慢,因为中断很少发生——如果需要合理的精度,直接模拟一个现实的模型可能需要几个小时。因此,这种方法对于那些希望评估和比较许多不同网络模型的性能的设计问题是没有用的。在这项工作中,我们实现了一个度量的变化,以估计停机概率使用重要抽样。我们提出了一种能够学习测度变化的最佳参数的泛函估计器和随机逼近方法。
{"title":"Intelligent simulation for the estimation of the uplink outage probabilities in CDMA networks","authors":"F. Vázquez-Abad, I. Baltcheva","doi":"10.1109/WODES.2002.1167718","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167718","url":null,"abstract":"In CDMA mobile networks, callers that are transmitting through a power station may cause interference at other power stations. When many users are already connected in the network, a new call may cause the signal to noise ratio to drop below a tolerance threshold. This phenomenon is called 'outage' and it provides an important measure of performance, useful in the design and control of the system. Evaluating this probability analytically has proven unsuccessful and only approximations exist today. Direct simulation of such networks is at present very slow because outage occurs infrequently - it may take hours to simulate directly a realistic model if a reasonable precision is desired. Thus this approach is not useful for design problems where one wishes to evaluate and compare performance of many different network models. In this work we implement a change of measure to estimate the outage probability using importance sampling. We present a functional estimator and a stochastic approximation method that are capable of learning the best parameters for the change of measure.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126407356","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
Computing bounds for forbidden state reachability functions for controlled Petri nets 受控Petri网禁止状态可达函数的边界计算
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167692
L. Holloway, A. Khare
Characterizing uncontrollable reachability is a central issue in forbidden state control of discrete event systems. In this paper, we present methods for building expressions which estimate uncontrollable reachability in a general class of Petri nets and which characterize the control sets to ensure future markings will not be forbidden. These expressions are determined by constructing an abstract syntax tree from an analysis of the Petri net model of the system. We show that these expressions represent bounds that are useful for evaluating uncontrollable reachability and for evaluating control actions.
描述不可控可达性是离散事件系统禁止状态控制中的一个核心问题。在本文中,我们提出了在一般Petri网中构建估计不可控可达性的表达式的方法,并对控制集进行表征以确保将来的标记不会被禁止。通过分析系统的Petri网模型,构建抽象语法树来确定这些表达式。我们展示了这些表达式表示的边界对于评估不可控的可达性和评估控制动作是有用的。
{"title":"Computing bounds for forbidden state reachability functions for controlled Petri nets","authors":"L. Holloway, A. Khare","doi":"10.1109/WODES.2002.1167692","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167692","url":null,"abstract":"Characterizing uncontrollable reachability is a central issue in forbidden state control of discrete event systems. In this paper, we present methods for building expressions which estimate uncontrollable reachability in a general class of Petri nets and which characterize the control sets to ensure future markings will not be forbidden. These expressions are determined by constructing an abstract syntax tree from an analysis of the Petri net model of the system. We show that these expressions represent bounds that are useful for evaluating uncontrollable reachability and for evaluating control actions.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124671695","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
Centralized modular diagnosis and the phenomenon of coupling 集中模块化诊断和耦合现象
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167683
E. Garcia, F. Morant, R. Blasco-Gimenez, A. Correcher, E. Quiles
This paper studies modular decomposition as an approach for failure diagnosis based on discrete event systems. This paper also analyses the problem of coupling produced in the implementation of centralized modular diagnosers, as coupled diagnosers cannot carry out their own diagnosis task when there is a failure in another subsystem sharing a common energy or material flow. In addition, we propose a method to avoid diagnoser coupling, by means of decoupling functions using nonlocal information with respect to the coupled diagnoser and generated in the diagnoser where the failure has been isolated.
本文研究了基于离散事件系统的模块分解故障诊断方法。本文还分析了集中式模块化诊断器在实现过程中产生的耦合问题,即当共享同一能量或物质流的另一个子系统出现故障时,耦合诊断器无法执行自己的诊断任务。此外,我们提出了一种避免诊断器耦合的方法,通过使用非局部信息对耦合诊断器进行解耦,并在故障被隔离的诊断器中生成。
{"title":"Centralized modular diagnosis and the phenomenon of coupling","authors":"E. Garcia, F. Morant, R. Blasco-Gimenez, A. Correcher, E. Quiles","doi":"10.1109/WODES.2002.1167683","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167683","url":null,"abstract":"This paper studies modular decomposition as an approach for failure diagnosis based on discrete event systems. This paper also analyses the problem of coupling produced in the implementation of centralized modular diagnosers, as coupled diagnosers cannot carry out their own diagnosis task when there is a failure in another subsystem sharing a common energy or material flow. In addition, we propose a method to avoid diagnoser coupling, by means of decoupling functions using nonlocal information with respect to the coupled diagnoser and generated in the diagnoser where the failure has been isolated.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124965882","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}
引用次数: 9
Decentralized control of discrete event systems with bounded or unbounded delay communication 具有有界或无界延迟通信的离散事件系统的分散控制
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167664
S. Tripakis
We introduce problems of decentralized control with delayed communication, where delays are either unbounded or bounded by a given constant k. In the k-bounded-delay model, between the transmission of a message and its reception, the plant can execute at most k events. In the unbounded-delay model, the plant can execute any number of events between transmission and reception. We show that our framework yields an infinite hierarchy of control problems, /spl Cscr//spl Cscr/ =/spl Dscr//spl Cscr//spl Cscr//sub 0//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 1//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 2//spl sup//spl middot//spl middot//spl middot//spl sup//spl Dscr//spl Cscr//spl Uscr//spl Cscr//spl sup//spl Dscr//spl Cscr/ , where CC is the set of control problems solvable with a single controller (centralized case) and /spl Dscr//spl Cscr//spl Cscr//sub k/ (resp. /spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/) is the set of problems solvable with two controllers in a k-bounded-delay network (resp. two controllers in an unbounded-delay network, two controllers without communication). The above containments are strict. We prove the undecidability of checking the existence of controllers in the unbounded-delay case, or in the case without any communication. Finally, we prove that a decentralized observation problem with bounded-delay communication is decidable.
我们引入了具有延迟通信的分散控制问题,其中延迟要么是无界的,要么是由给定常数k限定的。在k有界延迟模型中,在消息的发送和接收之间,工厂可以执行最多k个事件。在无界延迟模型中,设备可以在发送和接收之间执行任意数量的事件。我们表明,框架收益率无限层次的控制问题,spl Cscr / / spl Cscr / = / spl Dscr / / spl Cscr / / spl Cscr / /子0 / / spl一口/ / spl Dscr / / spl Cscr / / spl Cscr / /子1 / / spl一口/ / spl Dscr / / spl Cscr / / spl Cscr / /子2 / / spl一口/ / spl压力/ / spl压力/ / spl压力/ / spl一口/ / spl Dscr / / spl Cscr / / spl Uscr / / spl Cscr / / spl一口/ / spl Dscr / / spl Cscr / CC在哪里的一组控制问题可以用一个控制器(集中)和/ spl Dscr / / spl Cscr / / spl Cscr / / sub k /(分别地。/spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/)是k-有界延迟网络中两个控制器可解的问题集。无边界延迟网络中的两个控制器(两个没有通信的控制器)。以上约束是严格的。证明了在无界延迟情况下和在无通信情况下,控制器是否存在的不可判定性。最后,我们证明了具有有界延迟通信的分散观测问题是可判定的。
{"title":"Decentralized control of discrete event systems with bounded or unbounded delay communication","authors":"S. Tripakis","doi":"10.1109/WODES.2002.1167664","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167664","url":null,"abstract":"We introduce problems of decentralized control with delayed communication, where delays are either unbounded or bounded by a given constant k. In the k-bounded-delay model, between the transmission of a message and its reception, the plant can execute at most k events. In the unbounded-delay model, the plant can execute any number of events between transmission and reception. We show that our framework yields an infinite hierarchy of control problems, /spl Cscr//spl Cscr/ =/spl Dscr//spl Cscr//spl Cscr//sub 0//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 1//spl sup//spl Dscr//spl Cscr//spl Cscr//sub 2//spl sup//spl middot//spl middot//spl middot//spl sup//spl Dscr//spl Cscr//spl Uscr//spl Cscr//spl sup//spl Dscr//spl Cscr/ , where CC is the set of control problems solvable with a single controller (centralized case) and /spl Dscr//spl Cscr//spl Cscr//sub k/ (resp. /spl Dscr//spl Cscr//spl Uscr//spl Cscr/, /spl Dscr//spl Cscr/) is the set of problems solvable with two controllers in a k-bounded-delay network (resp. two controllers in an unbounded-delay network, two controllers without communication). The above containments are strict. We prove the undecidability of checking the existence of controllers in the unbounded-delay case, or in the case without any communication. Finally, we prove that a decentralized observation problem with bounded-delay communication is decidable.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126852615","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}
引用次数: 112
An extended event graph with negative places and negative tokens for time window constraints 带有负位置和负标记的扩展事件图,用于时间窗口约束
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167674
Tae-Eog Lee, Jeong-Won Seo, Seong-Ho Park
We introduce negative places and negative tokens into timed event graphs in order to model and analyze time window constraints. A negative token moves backward at an associated transition firing. We develop a necessary and sufficient condition, based on the circuits, for the event graph to be live. A sequence of feasible infinite firing epochs exists for each transition. We present a linear programming model for finding a stable firing schedule. We also characterize the minimal cycle time as a revised critical circuit ratio and the range of the feasible cycle times.
我们在时间事件图中引入负位置和负标记,以便建模和分析时间窗口约束。负令牌在关联的转换触发时向后移动。在电路的基础上,给出了事件图为活的充分必要条件。每个跃迁都存在一个可行的无限发射期序列。我们提出了一个线性规划模型来寻找一个稳定的发射计划。我们还将最小周期时间描述为修正的临界电路比和可行周期时间的范围。
{"title":"An extended event graph with negative places and negative tokens for time window constraints","authors":"Tae-Eog Lee, Jeong-Won Seo, Seong-Ho Park","doi":"10.1109/WODES.2002.1167674","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167674","url":null,"abstract":"We introduce negative places and negative tokens into timed event graphs in order to model and analyze time window constraints. A negative token moves backward at an associated transition firing. We develop a necessary and sufficient condition, based on the circuits, for the event graph to be live. A sequence of feasible infinite firing epochs exists for each transition. We present a linear programming model for finding a stable firing schedule. We also characterize the minimal cycle time as a revised critical circuit ratio and the range of the feasible cycle times.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133261585","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}
引用次数: 13
期刊
Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1