Codiagnosability and coobservability in discrete event systems where observations are dynamic considered. Instead of having a fixed set observable events, the observation an is (trace-dependent) this paper. A procedure developed to transform problem codiagnosability context observations. This proves that problems transformable enables us leverage large literature available for solve coobservability. Furthermore, case observations, known polynomial-complexity tests property based on verifier...

This paper considers centralized and decentralized control problems for partially-observed discrete event systems where sensor readings are assumed to be costly reasons of bandwidth, energy, or security. The supervisory controllers, agents, dynamically request sensors as needed observe the trajectories system correctly implement given feedback law. Thus, each may turned on/off several times along a trajectory. Different policies dynamic activation can used by agents. A set is said minimal if...

Developers are often faced with a natural language change request (such as bug report) and tasked identifying all code elements that must be modified in order to fulfill the (e.g., fix or implement new feature). In accomplish this task, developers frequently routinely perform impact analysis. This formal demonstration paper presents ImpactMiner, tool implements an integrated approach software The proposed estimates set using adaptive combination of static textual analysis, dynamic execution...

In a networked discrete event system, communication between plant and supervisor/agent is carried out via wired/wireless network, in which delays are unavoidable. Hence, how to obtain state estimates under an important problem. The existing methods assume that there only one channel and, thus, the first-in, first-out (FIFO) property satisfied. complex systems distributed over several locations, channels often used send occurrences (central) supervisor/agent, FIFO holds for each may be...

The problem of minimizing communication event occurrences in systems modeled by finite-state automata is considered. There are <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> communicating agents observing the behavior system for purposes control or diagnosis. A set policies said to be minimal if communications cannot removed without affecting correctness solution. Under an assumption on absence cycles (other than self-loops) model,...

The digital watermarking for video is an effective method to protect the copyright. Based on previous techniques, this paper summarizes their theories, features, model and classic algorithms then discusses algorithms' advantages disadvantages. Finally, key techniques development tendency of are discussed.

In order to control a discrete-event system (DES), the supervisory controller observes event sequences. Observability, together with controllability, is required for obtaining exact specification language via control. By extending observability, relative observability was recently investigated. this article, network which accommodates observation incompleteness and delay in defined. An algorithm proposed transform observability. This leverages existing solutions problems concerning solve...

Wireless mesh networks (WMNs) have become a critical part of Internet protocol (IP) networks, in particular the last or first mile. They can be applied to many scenarios such as home networking, community enterprise and so on. On other hand, voice over IP (VoIP) provides an attractive approach delivering traffic different types networks. Thus, VoIP has one killer applications WMNs. To date few research work been carried out investigate performance WMNs, challenging issues remain resolved. In...

This note studies two closely related decision problems from the area of decentralized synthesis. The first problem is about deciding existence a non-empty decomposable sublanguage regular language, called Decomposable Sublanguage Problem; second Joint Observability Problem, which known in literature. We provide characterizations decidability both problems. Then, we study undecidability such as Distributed Supervisory Control Problem and Parametrized Synthesis Problem. To address these...

Sensors are activated/deactivated according to a sensor activation policy (SAP), which is decision function whose domain the language of system. An SAP minimal for diagnosability if it at point where system diagnosable, but any additional deactivation prevents correct diagnosis. Given that diagnosable when all sensors always activated, we find in this paper does not exist. We therefore develop algorithms compute under pseudodiagnosable. Adhering such extends window opportunity proper...

The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can turned on/off during the operation system. agent activates sensors as needed order observe trajectories correctly implement given feedback control law. Different policies used by agent. A policy said minimal if any strictly less prevents correct implementation systematic formulation obtained solution procedure proposed. An algorithm that computes presented....

To observe occurrences of an event in a discrete system, sensor must be placed and activated. Both placement activation incur costs. Assuming sensors have been placed, to minimize costs, one would like the sensors. In this paper, online algorithm is developed activation. The system under consideration modeled by finite automaton. objective observation distinguish certain pairs states automaton, which are called specification. This specification extended account for future evolution partial...

基于山西大学自主开发的汉语框架语义知识库(CFN),将语义角色标注问题通过IOB策略转化为词序列标注问题,采用条件随机场模型,研究了汉语框架语义角色的自动标注.模型以词为基本标注单元,选择词、词性、词相对于目标词的位置、目标词及其组合为特征.针对每个特征设定若干可选的窗口,组合构成模型的各种特征模板,基于统计学中的正交表,给出一种较优模板选择方法.全部实验在选出的25个框架的6 692个例句的语料上进行.对每一个框架,分别按照其例句训练一个模型,同时进行语义角色的边界识别与分类,进行2-fold交叉验证.在给定句子中的目标词以及目标词所属的框架情况下,25个框架交叉验证的实验结果的准确率、召回率、F1-值分别达到74.16%,52.70%和61.62%.;Based on the semantic knowledge base of Chinese FrameNet (CFN) self-developed by Shanxi University, automatic labeling roles is turned into a sequential tagging...

This paper is about efficiently analyzing deadlock and blocking for systems consisting of isomorphic modules instantiated from a template. By refining the template, our approach captures essential interactions among determine whether system an arbitrary number free or free, while avoid their explicit synchronization. When answer negative, identifies largest module number, up to which satisfies each these properties.

Consider the problem of designing a supervisory control in which supervisor has not merely over inputs (or actuators), but can also choose to turn sensors on or off. In this context, flexibly adjust set activated reduce sensor utilization without compromising correctness decisions. Building upon existing methods for computing transition-based minimal activation policy, algorithms are presented technical note all policies. This result is then extended minimizing numerical cost systems modeled...

Opacity is an important information-flow property that arises in security and privacy analysis of cyber-physical systems. It captures the plausible deniability system's "secret" presence a malicious intruder modeled as passive observer. As specific type opacity, infinite-step opacity requires can never determine unambiguously system was at secret for any instant past. Existing works on only provide binary characterization, i.e., either opaque or non-opaque. However, non-infinite-step-opaque...

With a growing number of interacting modules in today's complex systems, finding an effective tool for detecting design errors has become increasingly challenging. We present procedures analyzing blocking or deadlock systems consisting isomorphic instantiated from template. These identify all possible sources and directly compute the maximum under which system is guaranteed to be nonblocking deadlock-free.