Automata Based Interfaces for Control and Scheduling

Weiss, Gera; Alur, Rajeev

doi:10.1007/978-3-540-71493-4_46

Cited by 55 publications

(70 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Weiss and Alur [WA07] consider automata theory to find the language that does not violate the performance requirements of a system. Then, a non-empty intersection of the scheduling automaton and performance requirements automata indicates the schedulability of the system.…”

Section: State Of the Artmentioning

confidence: 99%

Analysis, Design, and Optimization of Embedded Control Systems

Aminifar

2016

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

T oday, many embedded or cyber-physical systems, e.g., in the automotive domain, comprise several control applications, sharing the same platform. It is well known that such resource sharing leads to complex temporal behaviors that degrades the quality of control, and more importantly, may even jeopardize stability in the worst case, if not properly taken into account.In this thesis, we consider embedded control or cyber-physical systems, where several control applications share the same processing unit. The focus is on the control-scheduling co-design problem, where the controller and scheduling parameters are jointly optimized. The fundamental difference between control applications and traditional embedded applications motivates the need for novel methodologies for the design and optimization of embedded control systems. This thesis is one more step towards correct design and optimization of embedded control systems.Offline and online methodologies for embedded control systems are covered in this thesis. The importance of considering both the expected control performance and stability is discussed and a controlscheduling co-design methodology is proposed to optimize control performance while guaranteeing stability. Orthogonal to this, bandwidthefficient stabilizing control servers are proposed, which support compositionality, isolation, and resource-efficiency in design and co-design. Finally, we extend the scope of the proposed approach to non-periodic control schemes and address the challenges in sharing the platform with self-triggered controllers. In addition to offline methodologies, v a novel online scheduling policy to stabilize control applications is proposed. The research presented in this thesis has been partially funded by CUGS (the National Graduate School in Computer Science in Sweden), Ericsson's Research Foundation, eLLIIT (Excellence Center at Linköping-Lund on Information Technology), and the Swedish Research Council.Populärvetenskaplig Sammanfattning I dag omfattar många inbyggda system flera styrapplikationer som delar samma plattform. Dessa system används inom exempelvis bilindustrin, processindustrin och flygelektronik, för att nämna några. Det är välkänt att en sådan resursdelning leder till komplexa tidsbeteenden som försämrar kvaliteten på regleringen och i värsta fall kan även stabiliteten förloras.I denna avhandling betraktar vi inbyggda styrsystem, där flera styrapplikationer delar samma behandlingsenhet. Här har vi valt att fokusera på reglering-schemaläggning co-designproblemet. Till skillnad från traditionella inbyggda system där regleringsparametrarna och schemaläggningsparametrarna optimeras separat, behöver vi nu för inbyggda styrsystem optimera dessa samtidigt, vilket ger upphov till nya metoder. Denna avhandling är ytterligare ett steg mot effektiv design och optimering av inbyggda styrsystem.vii

show abstract

Section: State Of the Artmentioning

confidence: 99%

Analysis, Design, and Optimization of Embedded Control Systems

Aminifar

2016

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

show abstract

“…On the timing analysis/verification side, [5] and [6] first showed that certain control performance requirements induce scheduling specifications that are ω-regular languages. They then describe the construction of a scheduling automaton where every path leads to a schedule for a single ECU that guarantees all the individual performance requirements.…”

Section: A Related Workmentioning

confidence: 99%

Fault-tolerant control synthesis and verification of distributed embedded systems

Kauer¹,

Soudbakhsh

Goswami

et al. 2014

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2014

View full text Add to dashboard Cite

Abstract-We deal with synthesis of distributed embedded control systems closed over a faulty or severely constrained communication network. Such overloaded communication networks are common in cost-sensitive domains such as automotive. Design of such systems aims to meet all deadlines following the traditional notion of schedulability. In this work, we aim to exploit robustness of the controller and propose a novel implementation approach to achieve a tighter design. Toward this, we answer two research questions: (i) given a distributed architecture, how to characterize and formally verify the bound on deadline misses, (ii) given such a bound, how to design a controller such that desired stability and Quality of Control (QoC) requirements are met. We address question (i) by modeling a distributed embedded architecture as a network of Event Count Automata (ECA), and subsequently introducing and formally verifying a property formulation with reduced complexity. We address question (ii) by introducing a novel fault-tolerant control strategy which adjusts the control input at runtime based on the occurrence of fault or drop. We show that QoC under faulty communication improves significantly using the proposed fault-tolerant strategy.

show abstract

“…For example, in Section IV we show how the methods presented in [17], [18], [33] are applied in the context of multi-hop control networks. Specifically, the theory of formal languages is applied for answering competing resource requirements of the loops to achieve stability of the whole system.…”

Section: J Multi-hop Control Network As Switched Systemsmentioning

confidence: 99%

“…It is also easy to verify that the probability of stability is higher than the probability of exponential stability for any parameters and . A system might be stable but converge to equilibrium slowly, while exponential stability bounds the rate of convergence from above and thus may prove more suitable for applications where fast convergence is required (see [17] for a similar discussion).…”

Section: A Permanent Failuresmentioning

confidence: 99%

See 1 more Smart Citation

Compositional Modeling and Analysis of Multi-Hop Control Networks

Alur

D’Innocenzo

Johansson

et al. 2011

IEEE Trans. Automat. Contr.

Self Cite

108

105

View full text Add to dashboard Cite

Abstract-We propose a mathematical framework for modeling and analyzing multi-hop control networks designed for systems consisting of multiple control loops closed over a multi-hop (wireless) communication network. We separate control, topology, routing, and scheduling and propose formal syntax and semantics for the dynamics of the composed system, providing an explicit translation of multi-hop control networks to switched systems. We propose formal models for analyzing robustness of multi-hop control networks, where data is exchanged through a multi-hop communication network subject to disruptions. When communication disruptions are long, compared to the speed of the control system, we propose to model them as permanent link failures. We show that the complexity of analyzing such failures is NP-hard, and discuss a way to overcome this limitation for practical cases using compositional analysis. For typical packet transmission errors, we propose a transient error model where links fail for one time slot independently of the past and of other links. We provide sufficient conditions for almost sure stability in presence of transient link failures, and give efficient decision procedures. We deal with errors that have random time span and show that, under some conditions, the permanent failure model can be used as a reliable abstraction. Our approach is compositional, namely it addresses the problem of designing scalable scheduling and routing policies for multiple control loops closed on the same multi-hop control network. We describe how the translation of multi-hop control networks to switched systems can be automated, and use it to solve control and networking co-design challenges in some representative examples, and to propose a scheduling solution in a mineral floatation control problem that can be implemented on a time triggered communication protocols for wireless networks.Index Terms-Compositional analysis, multi-hop sensor and actuator networks, networked control.

show abstract

Automata Based Interfaces for Control and Scheduling

Cited by 55 publications

References 18 publications

Analysis, Design, and Optimization of Embedded Control Systems

Analysis, Design, and Optimization of Embedded Control Systems

Fault-tolerant control synthesis and verification of distributed embedded systems

Compositional Modeling and Analysis of Multi-Hop Control Networks

Contact Info

Product

Resources

About