Discrete event dynamic systems最新文献_第3页

A multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithms 基于监督控制理论和启发式算法的多生产路线制造系统多目标求解方法

Discrete event dynamic systems Pub Date : 2023-10-13 DOI: 10.1007/s10626-023-00379-7

Lucas V. R. Alves, Gustavo C. Rafael, Lucas S. Batista, Patrícia N. Pena

引用次数: 0

Correction to: Transformational supervisor synthesis for evolving systems 修正:演化系统的转换监督综合

Discrete event dynamic systems Pub Date : 2023-10-03 DOI: 10.1007/s10626-023-00384-w

Sander Thuijsman, Michel Reniers

引用次数: 1

Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition 扩展最终伪周期函数的网络演算算法工具箱:伪逆和复合

Discrete event dynamic systems Pub Date : 2023-08-18 DOI: 10.1007/s10626-022-00373-5

Raffaele Zippo, Paul Nikolaus, Giovanni Stea

{"title":"Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition","authors":"Raffaele Zippo, Paul Nikolaus, Giovanni Stea","doi":"10.1007/s10626-022-00373-5","DOIUrl":"https://doi.org/10.1007/s10626-022-00373-5","url":null,"abstract":"Abstract Network Calculus (NC) is an algebraic theory that represents traffic and service guarantees as curves in a Cartesian plane, in order to compute performance guarantees for flows traversing a network. NC uses transformation operations, e.g., min-plus convolution of two curves, to model how the traffic profile changes with the traversal of network nodes. Such operations, while mathematically well-defined, can quickly become unmanageable to compute using simple pen and paper for any non-trivial case, hence the need for algorithmic descriptions. Previous work identified the class of piecewise affine functions which are ultimately pseudo-periodic (UPP) as being closed under the main NC operations and able to be described finitely. Algorithms that embody NC operations taking as operands UPP curves have been defined and proved correct, thus enabling software implementations of these operations. However, recent advancements in NC make use of operations, namely the lower pseudo-inverse , upper pseudo-inverse , and composition , that are well-defined from an algebraic standpoint, but whose algorithmic aspects have not been addressed yet. In this paper, we introduce algorithms for the above operations when operands are UPP curves, thus extending the available algorithmic toolbox for NC. We discuss the algorithmic properties of these operations, providing formal proofs of correctness.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136020690","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

Discovering petri nets including silent transitions. A repairing approach based on structural patterns 发现petri网，包括无声转换。一种基于结构模式的修复方法

Discrete event dynamic systems Pub Date : 2022-02-07 DOI: 10.1007/s10626-021-00358-w

Román Pomares-Angelino, Ernesto López-Mellado

引用次数: 3

A general language-based framework for specifying and verifying notions of opacity 用于指定和验证不透明性概念的通用基于语言的框架

Discrete event dynamic systems Pub Date : 2022-02-02 DOI: 10.1007/s10626-021-00357-x

Andrew Wintenberg, Matthew Blischke, Stéphane Lafortune, Necmiye Ozay

引用次数: 16

Discrete-event systems subject to unknown sensor attacks 受到未知传感器攻击的离散事件系统

Discrete event dynamic systems Pub Date : 2021-12-10 DOI: 10.1007/s10626-021-00351-3

Alves, Michel R. C., Pena, Patrícia N., Rudie, Karen

{"title":"Discrete-event systems subject to unknown sensor attacks","authors":"Alves, Michel R. C., Pena, Patrícia N., Rudie, Karen","doi":"10.1007/s10626-021-00351-3","DOIUrl":"https://doi.org/10.1007/s10626-021-00351-3","url":null,"abstract":"This work is set in the context of supervisory control of discrete-event systems under partial observation. Attackers that are able to insert or erase occurrences of particular output symbols can tamper with the supervisor’s observation and by doing so, can lead the controlled system to undesirable states. We consider a scenario with multiple attackers, each one being an element of a set, called the attack set. We also assume that only one of the attackers within an attack set is acting, although we don’t know which one. According to previous results in the literature, a supervisor that enforces a given legal language, regardless of which attacker is acting, can be designed if the legal language is controllable and satisfies a property called P-observability for an attack set. The latter is an extended notion of observability and is related with the supervisor’s ability to always distinguish between outputs that require different control actions, even if the outputs were attacked. We present a new approach for checking if a given language is P-observable for an attack set, by first introducing a visual representation as well as some definitions that capture the attack’s effect. Additionally, we present two algorithms that together allow us to verify if a given language is P-observable for an attack set, when it is represented as an automaton.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"25 49","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495703","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 diagnosis of discrete event systems subject to permanent sensor failures 受永久传感器故障影响的离散事件系统的分散诊断

Discrete event dynamic systems Pub Date : 2021-11-08 DOI: 10.1007/s10626-021-00353-1

Wada, Akihito, Takai, Shigemasa

{"title":"Decentralized diagnosis of discrete event systems subject to permanent sensor failures","authors":"Wada, Akihito, Takai, Shigemasa","doi":"10.1007/s10626-021-00353-1","DOIUrl":"https://doi.org/10.1007/s10626-021-00353-1","url":null,"abstract":"In this paper, we consider a decentralized failure diagnosis problem for discrete event systems. Each local diagnoser makes a diagnosis decision based on local event observations. A sensor that detects the occurrence of an event may possibly fail due to, for example, aging degradation. It is desirable that the occurrence of any failure string should be correctly detected in the presence of sensor failures. We introduce a new notion of codiagnosability subject to permanent sensor failures, which is defined with respect to not only the set of nondeterministic local observation masks but also the global nondeterministic observation mask. Although the global observation mask is necessary to define codiagnosability, it is not used for performing decentralized diagnosis. The introduced notion of codiagnosability guarantees that the occurrence of any failure string can be correctly detected by a decentralized diagnoser within a bounded number of steps even if permanent sensor failures occur. We develop a method for verifying the codiagnosability property subject to permanent sensor failures. In addition, we compute the delay bound within which the occurrence of any failure string can be detected.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"25 51","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495702","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}

引用次数: 0

Supervisory controller synthesis and implementation for safety PLCs 安全plc监控控制器的合成与实现

Discrete event dynamic systems Pub Date : 2021-11-06 DOI: 10.1007/s10626-021-00350-4

Reijnen, Ferdie F. H., Erens, Toby R., van de Mortel-Fronczak, Joanna M., Rooda, Jacobus E.

{"title":"Supervisory controller synthesis and implementation for safety PLCs","authors":"Reijnen, Ferdie F. H., Erens, Toby R., van de Mortel-Fronczak, Joanna M., Rooda, Jacobus E.","doi":"10.1007/s10626-021-00350-4","DOIUrl":"https://doi.org/10.1007/s10626-021-00350-4","url":null,"abstract":"The development of supervisory controllers for cyber-physical systems is a laborious and error-prone process. Supervisor synthesis enables control designers to automatically synthesize a correct-by-construction supervisor from a model of the plant combined with a model of the control requirements. From the supervisor model, controller code can be generated which is suitable for the implementation on a programmable logic controller (PLC). Supervisors for industrial systems that operate in close proximity to humans have to adhere to strict safety standards. To achieve these standards, safety PLCs (SPLCs) are used. For SPLC implementation, the supervisor has to be split into a regular part and a safety part. In previous work, a method is proposed to automatically split a supervisor model for this purpose. The method assumes that the provided plant model is a collection of finite automata. In this paper, the extension to extended finite automata is described. Additionally, guidelines are provided for modeling the plant and the requirements to achieve a favorable splitting. A case study on a rotating bridge is elaborated which has been used to validate the method. The case study spans all development steps, including the implementation of the resulting supervisor to control the real bridge.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"25 52","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495701","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

Hierarchical planning in a supervisory control context with compositional abstraction 具有组合抽象的监督控制上下文中的分层规划

Discrete event dynamic systems Pub Date : 2021-09-14 DOI: 10.1007/s10626-021-00349-x

Vilela, Juliana, Hill, Richard

{"title":"Hierarchical planning in a supervisory control context with compositional abstraction","authors":"Vilela, Juliana, Hill, Richard","doi":"10.1007/s10626-021-00349-x","DOIUrl":"https://doi.org/10.1007/s10626-021-00349-x","url":null,"abstract":"Hierarchy is a tool that has been applied to improve the scalability of solving planning problems modeled using Supervisory Control Theory. In the work of Hill and Lafortune (2016), the notion of cost equivalence was employed to generate an abstraction of the supervisor that, with additional conditions, guarantees that an optimal plan generated on the abstraction is also optimal when applied to the full supervisor. Their work is able to improve their abstraction by artificially giving transitions zero cost based on the sequentially-dependent ordering of events. Here, we relax the requirement on a specific ordering of the dependent events, while maintaining the optimal relationship between upper and lower levels of the hierarchy. This present paper also extends the authors’ work (Vilela and Hill 2020) where we developed a new notion of equivalence based on cost equivalence and weak bisimulation that we term priced-observation equivalence. This equivalence allows the supervisor abstraction to be generated compositionally. This helps to avoid the explosion of the state space that arises from having to first synthesize the full supervisor before the abstraction can be applied. Here, we also show that models with artificial zero-cost transitions can be created compositionally employing the new relaxed sequential dependence definition. An example cooperative robot control application is used to demonstrate the improvements achieved by the compositional approach to abstraction proposed by this paper.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"25 53","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495700","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

Interpreted synchronous extension of time Petri nets 解释同步扩展时间Petri网

Discrete event dynamic systems Pub Date : 2021-09-08 DOI: 10.1007/s10626-021-00347-z

Godary-Dejean, Karen, Leroux, Hélène, Andreu, David

{"title":"Interpreted synchronous extension of time Petri nets","authors":"Godary-Dejean, Karen, Leroux, Hélène, Andreu, David","doi":"10.1007/s10626-021-00347-z","DOIUrl":"https://doi.org/10.1007/s10626-021-00347-z","url":null,"abstract":"Our work is integrated into a global methodology to design synchronously executed embedded critical systems. It is used for the development of medical devices implanted into human body to perform functional electrical stimulation solutions (used in pacemakers, deep brain stimulation...). These systems are of course critical and real time, and the reliability of their behaviors must be guaranteed. These medical devices are implemented into a programmable logic circuit in a synchronous way, which allows efficient implementation (space, consumption and actual parallelism of tasks execution). This paper presents a solution that helps to prove that the behavior of the implemented system respects a set of properties, using Petri nets for modeling and analysis purposes. But one problem in formal methods is that the hardware target and the implementation strategy can have an influence on the execution of the system, but is usually not considered in the modeling and verification processes. Resolving this issue is the goal of this article. Our work has two main results: an operational one, and a theoretical one. First, we can now design critical controllers with hard safety or real time constraints, being sure the behavior is still guaranteed during the execution. Second, this work broadens the scope of expressivity and analyzability of Petri nets extensions. Until then, none managed in the same formalism, both for modeling and analysis, all the characteristics we have considered (weights on arcs, specific test and inhibitor arcs, interpretation, and time intervals, including the management of effective conflicts and the blocking of transitions).","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"25 55","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495699","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