3,500 research outputs found

    Predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs

    Get PDF
    The aim of this paper is the predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs. We propose a fixed-point approach which leads to a pseudo-polynomial algorithm. As the performance of the algorithm is crucial in on-line control, we highlight an important case where the resolution of this first algorithm is efficient. The second technique is a space controller on a horizon leading to a strongly polynomial algorithm

    Compromise Approach for Predictive Control of Timed Event Graphs with Specifications Defined by P-time Event Graphs

    Get PDF
    In this paper, the aim is to make the predictive control of a plant described by a Timed Event Graph which follows the specifications defined by a P-time Event Graph. We propose a compromise approach between the ideal optimality of the solution and the on-line application of the computed solution when the relevant optimal control cannot be applied for a given computer. The technique is based on a reduction of the number of iterations of the fixed point algorithm such that the computed control remains causal. The analysis of the partial satisfaction of the specifications at each iteration of the algorithm defined in the (max, +) algebra shows that a subset of constraints is guaranteed by the control computed at each iteration while another one is possibly satisfied

    Trajectory Tracking Control of a Timed Event Graph with Specifications Defined by a P-time Event Graph

    Get PDF
    The aim of this paper is a trajectory tracking control of Timed Event Graphs with specifications defined by a P-time Event Graph. Two problems are solved on a fixed horizon knowing the current state: The optimal control for favorable past evolution; The prediction of the earliest future evolution of the process. These two parts make up an on-line control which is used on a sliding horizon. Completely defined in (max, +) algebra, the proposed approach is a Model Predictive Control using the componentwise order relation

    Discrete events: Perspectives from system theory

    Get PDF
    Systems Theory;differentiaal/ integraal-vergelijkingen

    Model-based dependability analysis : state-of-the-art, challenges and future outlook

    Get PDF
    Abstract: Over the past two decades, the study of model-based dependability analysis has gathered significant research interest. Different approaches have been developed to automate and address various limitations of classical dependability techniques to contend with the increasing complexity and challenges of modern safety-critical system. Two leading paradigms have emerged, one which constructs predictive system failure models from component failure models compositionally using the topology of the system. The other utilizes design models - typically state automata - to explore system behaviour through fault injection. This paper reviews a number of prominent techniques under these two paradigms, and provides an insight into their working mechanism, applicability, strengths and challenges, as well as recent developments within these fields. We also discuss the emerging trends on integrated approaches and advanced analysis capabilities. Lastly, we outline the future outlook for model-based dependability analysis

    Decentralized Abstractions and Timed Constrained Planning of a General Class of Coupled Multi-Agent Systems

    Full text link
    This paper presents a fully automated procedure for controller synthesis for a general class of multi-agent systems under coupling constraints. Each agent is modeled with dynamics consisting of two terms: the first one models the coupling constraints and the other one is an additional bounded control input. We aim to design these inputs so that each agent meets an individual high-level specification given as a Metric Interval Temporal Logic (MITL). Furthermore, the connectivity of the initially connected agents, is required to be maintained. First, assuming a polyhedral partition of the workspace, a novel decentralized abstraction that provides controllers for each agent that guarantee the transition between different regions is designed. The controllers are the solution of a Robust Optimal Control Problem (ROCP) for each agent. Second, by utilizing techniques from formal verification, an algorithm that computes the individual runs which provably satisfy the high-level tasks is provided. Finally, simulation results conducted in MATLAB environment verify the performance of the proposed framework

    Model-driven development of data intensive applications over cloud resources

    Full text link
    The proliferation of sensors over the last years has generated large amounts of raw data, forming data streams that need to be processed. In many cases, cloud resources are used for such processing, exploiting their flexibility, but these sensor streaming applications often need to support operational and control actions that have real-time and low-latency requirements that go beyond the cost effective and flexible solutions supported by existing cloud frameworks, such as Apache Kafka, Apache Spark Streaming, or Map-Reduce Streams. In this paper, we describe a model-driven and stepwise refinement methodological approach for streaming applications executed over clouds. The central role is assigned to a set of Petri Net models for specifying functional and non-functional requirements. They support model reuse, and a way to combine formal analysis, simulation, and approximate computation of minimal and maximal boundaries of non-functional requirements when the problem is either mathematically or computationally intractable. We show how our proposal can assist developers in their design and implementation decisions from a performance perspective. Our methodology allows to conduct performance analysis: The methodology is intended for all the engineering process stages, and we can (i) analyse how it can be mapped onto cloud resources, and (ii) obtain key performance indicators, including throughput or economic cost, so that developers are assisted in their development tasks and in their decision taking. In order to illustrate our approach, we make use of the pipelined wavefront array.Comment: Preprin

    Formal Methods in Factory Automation

    Get PDF
    corecore