首页 > 最新文献

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

英文 中文
Perturbation analysis and optimization of a flow controlled manufacturing system 流控制造系统的摄动分析与优化
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167697
Haining Yu, C. Cassandras
We use Stochastic Fluid Models (SFM) to capture the operation of threshold-based flow control policies in manufacturing systems without resorting to detailed discrete event models. By applying Infinitesimal Perturbation Analysis (IPA) to a SFM of a workcenter we derive gradient estimators of throughput and buffer overflow metrics with respect to flow control parameters. It is shown that these gradient estimators are unbiased and independent of distributional information of supply and service processes involved. Moreover, they can be implemented using actual system data, which enables us to develop simple iterative schemes for adjusting thresholds (hedging points) on line so as to optimize an objective function that trades off throughput and buffer overflow costs.
我们使用随机流体模型(SFM)来捕捉制造系统中基于阈值的流量控制策略的操作,而无需求助于详细的离散事件模型。通过将无穷小摄动分析(IPA)应用于工作中心的SFM,我们推导了吞吐量和缓冲区溢出度量与流量控制参数相关的梯度估计。结果表明,这些梯度估计量是无偏的,并且与所涉及的供给和服务过程的分布信息无关。此外,它们可以使用实际的系统数据来实现,这使我们能够开发简单的迭代方案来在线调整阈值(对冲点),从而优化一个权衡吞吐量和缓冲区溢出成本的目标函数。
{"title":"Perturbation analysis and optimization of a flow controlled manufacturing system","authors":"Haining Yu, C. Cassandras","doi":"10.1109/WODES.2002.1167697","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167697","url":null,"abstract":"We use Stochastic Fluid Models (SFM) to capture the operation of threshold-based flow control policies in manufacturing systems without resorting to detailed discrete event models. By applying Infinitesimal Perturbation Analysis (IPA) to a SFM of a workcenter we derive gradient estimators of throughput and buffer overflow metrics with respect to flow control parameters. It is shown that these gradient estimators are unbiased and independent of distributional information of supply and service processes involved. Moreover, they can be implemented using actual system data, which enables us to develop simple iterative schemes for adjusting thresholds (hedging points) on line so as to optimize an objective function that trades off throughput and buffer overflow costs.","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":"130713717","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
Local contact state space generation using colored Petri nets 使用彩色Petri网生成局部接触状态空间
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167681
J. Rosell
The automatic synthesis of a plan to perform a robotized assembly task from a high level description of the product to be assembled is a difficult issue which involves assembly planning and task planning. One of the main scopes of task planning is the planning of contact motions, which usually relies on a graph representation of contact space. This paper deals with the automatic computation of the local contact space using colored Petri nets (CPN). The presented CPN model is to be integrated into a Petri net based system that copes with both planning issues, making use of the hierarchical nature of high level Petri nets.
从待装配产品的高层次描述中自动合成执行机器人装配任务的计划是一个涉及装配规划和任务规划的难题。任务规划的主要范围之一是接触运动的规划,这通常依赖于接触空间的图表示。本文研究了用彩色Petri网(CPN)自动计算局部接触空间的方法。所提出的CPN模型将集成到一个基于Petri网的系统中,该系统利用高级Petri网的分层性质来处理这两个规划问题。
{"title":"Local contact state space generation using colored Petri nets","authors":"J. Rosell","doi":"10.1109/WODES.2002.1167681","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167681","url":null,"abstract":"The automatic synthesis of a plan to perform a robotized assembly task from a high level description of the product to be assembled is a difficult issue which involves assembly planning and task planning. One of the main scopes of task planning is the planning of contact motions, which usually relies on a graph representation of contact space. This paper deals with the automatic computation of the local contact space using colored Petri nets (CPN). The presented CPN model is to be integrated into a Petri net based system that copes with both planning issues, making use of the hierarchical nature of high level Petri nets.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"64 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":"124894218","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
The effect of finite buffers on the optimal safety stock for unreliable systems 有限缓冲对不可靠系统最优安全库存的影响
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167710
M. Giordano, F. Martinelli, P. Valigi
In this paper we consider a single part-type, single unreliable machine production system under a fluid approximation to describe the part flow through the system. We will assume that only a finite space is available for waiting demand and customers arriving when the backlog buffer is full are rejected, incurring in a penalty. The problem is to determine a production control which minimizes an infinite horizon average loss/backlog/surplus cost. In the infinite buffer capacity case, this problem is solved by a hedging point policy. In this paper we consider the finite capacity case, and based on an equation presented in a previous paper we discuss the effect of some meaningful parameters on the computed hedging point and the effect of finite buffers on the optimality of Just In Time (JIT) policies. An adaptive control algorithm is realized to determine the optimal hedging point when the system parameters are not known and must be estimated through the observation of the system.
本文考虑一个单零件型、单不可靠机械生产系统,在流体近似下描述零件流经系统的流动。我们将假设只有有限的空间可用于等待需求,并且当积压缓冲区已满时到达的客户被拒绝,从而产生罚款。问题在于确定一种生产控制,使无限范围内的平均损失/积压/剩余成本最小化。在无限缓冲容量的情况下,用对冲点策略来解决这个问题。本文考虑了有限容量的情况,并在前人所提方程的基础上,讨论了一些有意义的参数对计算的对冲点的影响,以及有限缓冲区对准时制策略最优性的影响。实现了一种自适应控制算法,在系统参数未知且必须通过观察系统来估计的情况下确定最优对冲点。
{"title":"The effect of finite buffers on the optimal safety stock for unreliable systems","authors":"M. Giordano, F. Martinelli, P. Valigi","doi":"10.1109/WODES.2002.1167710","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167710","url":null,"abstract":"In this paper we consider a single part-type, single unreliable machine production system under a fluid approximation to describe the part flow through the system. We will assume that only a finite space is available for waiting demand and customers arriving when the backlog buffer is full are rejected, incurring in a penalty. The problem is to determine a production control which minimizes an infinite horizon average loss/backlog/surplus cost. In the infinite buffer capacity case, this problem is solved by a hedging point policy. In this paper we consider the finite capacity case, and based on an equation presented in a previous paper we discuss the effect of some meaningful parameters on the computed hedging point and the effect of finite buffers on the optimality of Just In Time (JIT) policies. An adaptive control algorithm is realized to determine the optimal hedging point when the system parameters are not known and must be estimated through the observation of the system.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"77 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":"127998371","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
Model predictive control for max-min-plus-scaling systems - efficient implementation 最大-最小-加尺度系统的模型预测控制——高效实现
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167709
B. de Schutter, T. van den Boom
In previous work we have introduced model predictive control (MPC) for max-plus-linear and max-min-plus(-scaling) discrete-event systems. For max-plus-linear systems there are efficient algorithms to solve the corresponding MPC optimization problems. However, previously, for max-min-plus(-scaling) systems the only approach was to consider a limited subclass of decoupled max-min-plus systems or to use nonlinear nonconvex optimization algorithms, which are not efficient if the size of the system or the MPC optimization problem is large. In this paper we present a more efficient approach that is based on canonical forms for max-min-plus-scaling functions and in which the MPC optimization problem is reduced to a set of linear programming problems.
在以前的工作中,我们介绍了模型预测控制(MPC)的最大加线性和最大最小加(缩放)离散事件系统。对于极大加线性系统,存在求解相应MPC优化问题的有效算法。然而,以前,对于max-min-plus(缩放)系统,唯一的方法是考虑解耦的max-min-plus系统的有限子类或使用非线性非凸优化算法,如果系统的规模或MPC优化问题很大,则这些算法效率不高。在本文中,我们提出了一种更有效的方法,该方法基于最大-最小-加缩放函数的规范形式,并将MPC优化问题简化为一组线性规划问题。
{"title":"Model predictive control for max-min-plus-scaling systems - efficient implementation","authors":"B. de Schutter, T. van den Boom","doi":"10.1109/WODES.2002.1167709","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167709","url":null,"abstract":"In previous work we have introduced model predictive control (MPC) for max-plus-linear and max-min-plus(-scaling) discrete-event systems. For max-plus-linear systems there are efficient algorithms to solve the corresponding MPC optimization problems. However, previously, for max-min-plus(-scaling) systems the only approach was to consider a limited subclass of decoupled max-min-plus systems or to use nonlinear nonconvex optimization algorithms, which are not efficient if the size of the system or the MPC optimization problem is large. In this paper we present a more efficient approach that is based on canonical forms for max-min-plus-scaling functions and in which the MPC optimization problem is reduced to a set of linear programming problems.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"50 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":"114890016","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
From discrete event to hybrid systems 从离散事件到混合系统
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167662
C. Cassandras
Hybrid systems have emerged as a result of combining conventional time-driven dynamics with event-driven dynamics. This provides an opportunity for frameworks and methodologies developed for discrete event systems to enlarge their scope, driven by applications that range from manufacturing to command-control systems. The goal of this paper is to explore this transition from the point of view of discrete event system theory. Many hybrid systems may be viewed as consisting of a lower-level component that corresponds to time-driven physical processes, which a higher-level component with event-driven dynamics is called upon to coordinate by switching between different process operating modes. We concentrate on the formulation of optimization problems that arise in this "hybrid" setting, where the control variables affect both higher and lower level components. We also discuss a natural evolution of perturbation analysis techniques for discrete event systems into similar methodologies for a class of hybrid systems, known as stochastic fluid models, that find wide applicability in the control of communication networks.
混合系统是将传统的时间驱动动力学与事件驱动动力学相结合的结果。这为为离散事件系统开发的框架和方法提供了机会,以扩大其范围,由从制造到命令控制系统的应用程序驱动。本文的目的是从离散事件系统理论的角度来探讨这种转变。许多混合系统可以被看作是由与时间驱动的物理过程相对应的低级组件组成的,而具有事件驱动的动力学的高级组件则被要求通过在不同的过程操作模式之间切换来进行协调。我们专注于在这种“混合”设置中出现的优化问题的公式,其中控制变量影响较高和较低级别的组件。我们还讨论了离散事件系统的扰动分析技术的自然演变为一类混合系统的类似方法,称为随机流体模型,在通信网络控制中具有广泛的适用性。
{"title":"From discrete event to hybrid systems","authors":"C. Cassandras","doi":"10.1109/WODES.2002.1167662","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167662","url":null,"abstract":"Hybrid systems have emerged as a result of combining conventional time-driven dynamics with event-driven dynamics. This provides an opportunity for frameworks and methodologies developed for discrete event systems to enlarge their scope, driven by applications that range from manufacturing to command-control systems. The goal of this paper is to explore this transition from the point of view of discrete event system theory. Many hybrid systems may be viewed as consisting of a lower-level component that corresponds to time-driven physical processes, which a higher-level component with event-driven dynamics is called upon to coordinate by switching between different process operating modes. We concentrate on the formulation of optimization problems that arise in this \"hybrid\" setting, where the control variables affect both higher and lower level components. We also discuss a natural evolution of perturbation analysis techniques for discrete event systems into similar methodologies for a class of hybrid systems, known as stochastic fluid models, that find wide applicability in the control of communication networks.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"16 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":"129572128","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}
引用次数: 5
Liveness enforcing supervisors for railway networks using ES/sup 2/PR Petri nets 使用ES/sup 2/PR Petri网对铁路网实施监督
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167669
A. Giua, C. Seatzu
In this paper we consider a high-level description of a railway network using a skeleton net that belongs to the class of ES/sup 2/PR nets. The resource places of this model correspond to the action of a safeness enforcing supervisor. Liveness constraints may also be enforced for this class by adding appropriate monitor places designed using siphon analysis. We show how this can be done without an exhaustive computation of all siphons and characterize the cases in which this procedure can be recursively applied, giving a simple test for the closed loop net to remain an ES/sup 2/PR net.
在本文中,我们考虑使用ES/sup /PR网类的骨架网对铁路网进行高级描述。此模型的资源位置对应于安全执行主管的操作。通过添加使用虹吸分析设计的适当监视器位置,还可以对该类实施活动约束。我们展示了如何在没有对所有虹吸管进行详尽计算的情况下完成此操作,并描述了该过程可以递归应用的情况,给出了闭环网络保持ES/sup 2/PR网络的简单测试。
{"title":"Liveness enforcing supervisors for railway networks using ES/sup 2/PR Petri nets","authors":"A. Giua, C. Seatzu","doi":"10.1109/WODES.2002.1167669","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167669","url":null,"abstract":"In this paper we consider a high-level description of a railway network using a skeleton net that belongs to the class of ES/sup 2/PR nets. The resource places of this model correspond to the action of a safeness enforcing supervisor. Liveness constraints may also be enforced for this class by adding appropriate monitor places designed using siphon analysis. We show how this can be done without an exhaustive computation of all siphons and characterize the cases in which this procedure can be recursively applied, giving a simple test for the closed loop net to remain an ES/sup 2/PR net.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"1 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":"125819439","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}
引用次数: 16
Equivalence of timed state machines and safe TPN 时间状态机与安全TPN的等价性
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167678
S. Haar, L. Kaiser, F. Simonot-Lion, J. Toussaint
We show that an important subclass of timed automata (Alur and Dill, 1994), called timed state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the sense of Merlin and Farber (1976). We present an explicit construction for two-way translation between 1-safe TPNs and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.
我们证明了时间自动机的一个重要子类(Alur和Dill, 1994),称为时间状态机,在Merlin和Farber(1976)的意义上是弱时间等效于安全的非零时间Petri网(TPNs)。我们提出了1-安全tpn和tsm之间双向翻译的明确结构。这种转换提高了其他方法的效率:对于给定的网络,得到的TSM是可达图大小的多项式,并且给定的TSM被转换成一个网络,其大小与自动机模型的大小线性增长。
{"title":"Equivalence of timed state machines and safe TPN","authors":"S. Haar, L. Kaiser, F. Simonot-Lion, J. Toussaint","doi":"10.1109/WODES.2002.1167678","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167678","url":null,"abstract":"We show that an important subclass of timed automata (Alur and Dill, 1994), called timed state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the sense of Merlin and Farber (1976). We present an explicit construction for two-way translation between 1-safe TPNs and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"5 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":"122155224","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}
引用次数: 17
Diagnosis of asynchronous discrete event systems, a net unfolding approach 异步离散事件系统的诊断,一种网络展开方法
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167686
A. Benveniste, É. Fabre, S. Haar, C. Jard
This paper studies the diagnosis of asynchronous discrete event systems. We follow a so-called true concurrency approach, in which neither the global state nor global time are available. Instead, we use only local states in combination with a partial order model of time; our basic mathematical tool is that of Petri net unfoldings. This study was motivated by the problem of event correlation in telecommunications network management.
本文研究了异步离散事件系统的诊断问题。我们遵循所谓的真正并发方法,在这种方法中,全局状态和全局时间都不可用。相反,我们只使用局部状态与时间的偏序模型相结合;我们的基本数学工具是Petri网展开。本研究的动机是电信网络管理中的事件相关问题。
{"title":"Diagnosis of asynchronous discrete event systems, a net unfolding approach","authors":"A. Benveniste, É. Fabre, S. Haar, C. Jard","doi":"10.1109/WODES.2002.1167686","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167686","url":null,"abstract":"This paper studies the diagnosis of asynchronous discrete event systems. We follow a so-called true concurrency approach, in which neither the global state nor global time are available. Instead, we use only local states in combination with a partial order model of time; our basic mathematical tool is that of Petri net unfoldings. This study was motivated by the problem of event correlation in telecommunications network management.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"75 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":"123074961","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}
引用次数: 334
Towards a monitoring framework for discrete-event system simulations 离散事件系统模拟的监测框架
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167679
Bo Lindstrøm, Lisa Wells
This paper presents a framework for tools for monitoring discrete-event system models. Monitoring is any activity related to observing, inspecting, controlling or modifying a simulation of the model. We identify general patterns in how ad-hoc monitoring is done, and generalise these patterns to a uniform and flexible framework. A coloured Petri net model and simulator are used to illustrate how the framework can be used to create various types of monitoring tools. The framework is presented in general terms that are not specific to any particular formalism. The framework can serve as a reference for implementing different types of monitors in discrete-event system simulators.
本文提出了一个用于监测离散事件系统模型的工具框架。监测是与观察、检查、控制或修改模型模拟有关的任何活动。我们确定了如何进行特别监视的一般模式,并将这些模式概括为统一而灵活的框架。彩色Petri网模型和模拟器用于说明如何使用框架来创建各种类型的监控工具。该框架以一般术语呈现,不针对任何特定的形式主义。该框架可为在离散事件系统模拟器中实现不同类型的监视器提供参考。
{"title":"Towards a monitoring framework for discrete-event system simulations","authors":"Bo Lindstrøm, Lisa Wells","doi":"10.1109/WODES.2002.1167679","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167679","url":null,"abstract":"This paper presents a framework for tools for monitoring discrete-event system models. Monitoring is any activity related to observing, inspecting, controlling or modifying a simulation of the model. We identify general patterns in how ad-hoc monitoring is done, and generalise these patterns to a uniform and flexible framework. A coloured Petri net model and simulator are used to illustrate how the framework can be used to create various types of monitoring tools. The framework is presented in general terms that are not specific to any particular formalism. The framework can serve as a reference for implementing different types of monitors in discrete-event system simulators.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"263 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":"122907968","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}
引用次数: 14
Decentralized supervisory control: a new architecture with a dynamic decision fusion rule 分散监督控制:一种具有动态决策融合规则的新体系结构
Pub Date : 2002-10-02 DOI: 10.1109/WODES.2002.1167663
T. Yoo, S. Lafortune
We consider a decentralized control architecture for discrete-event systems where local supervisors are allowed to change dynamically the manner in which their local decisions are combined globally. This is done by changing the default decisions regarding the enablement of common controllable events. In previous work, this default was fixed a priori and remained constant throughout the operation of the system. We show that under dynamic decision fusion rules, a larger class of languages can be achieved as compared with architectures with static fusion rules. A dynamic version of the notion of co-observability appears in the necessary and sufficient conditions for the existence of supervisors in the new architecture. The dynamic co-observability relaxes (static) co-observability. The existence of a set of local dynamic default decision rules that ensures dynamic co-observability can be decided in polynomial time.
我们考虑了离散事件系统的分散控制体系结构,其中允许本地监督器动态改变其本地决策全局组合的方式。这是通过更改有关启用公共可控事件的默认决策来实现的。在以前的工作中,这个默认值是先验固定的,并且在整个系统运行过程中保持不变。研究表明,在动态决策融合规则下,与采用静态决策融合规则的体系结构相比,可以实现更大的语言类别。共同可观察性概念的动态版本出现在新体系结构中监管者存在的必要和充分条件中。动态共同可观测性使(静态)共同可观测性松弛。存在一组局部动态默认决策规则,保证在多项式时间内确定动态共观察性。
{"title":"Decentralized supervisory control: a new architecture with a dynamic decision fusion rule","authors":"T. Yoo, S. Lafortune","doi":"10.1109/WODES.2002.1167663","DOIUrl":"https://doi.org/10.1109/WODES.2002.1167663","url":null,"abstract":"We consider a decentralized control architecture for discrete-event systems where local supervisors are allowed to change dynamically the manner in which their local decisions are combined globally. This is done by changing the default decisions regarding the enablement of common controllable events. In previous work, this default was fixed a priori and remained constant throughout the operation of the system. We show that under dynamic decision fusion rules, a larger class of languages can be achieved as compared with architectures with static fusion rules. A dynamic version of the notion of co-observability appears in the necessary and sufficient conditions for the existence of supervisors in the new architecture. The dynamic co-observability relaxes (static) co-observability. The existence of a set of local dynamic default decision rules that ensures dynamic co-observability can be decided in polynomial time.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"1 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":"128016464","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}
引用次数: 10
期刊
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