8,977 research outputs found
Forwarding design with prescribed local behavior
International audienceAmong the non-linear control techniques, some Lyapunov design methods (Forwarding / Backstepping) take advantage of the structure of the system (Feedforward-form / Feedback-form) to formulate a continuous control law which stabilizes globally and asymptotically the equilibrium. In addition to stabilization, we focus on the local behaviour of the closed loop system, providing conditions under which we can predetermine the behaviour around the origin for Feedforward systems
Locally optimal controllers and globally inverse optimal controllers
In this paper we consider the problem of global asymptotic stabilization with
prescribed local behavior. We show that this problem can be formulated in terms
of control Lyapunov functions. Moreover, we show that if the local control law
has been synthesized employing a LQ approach, then the associated Lyapunov
function can be seen as the value function of an optimal problem with some
specific local properties. We illustrate these results on two specific classes
of systems: backstepping and feedforward systems. Finally, we show how this
framework can be employed when considering the orbital transfer problem
Work Analysis with Resource-Aware Session Types
While there exist several successful techniques for supporting programmers in
deriving static resource bounds for sequential code, analyzing the resource
usage of message-passing concurrent processes poses additional challenges. To
meet these challenges, this article presents an analysis for statically
deriving worst-case bounds on the total work performed by message-passing
processes. To decompose interacting processes into components that can be
analyzed in isolation, the analysis is based on novel resource-aware session
types, which describe protocols and resource contracts for inter-process
communication. A key innovation is that both messages and processes carry
potential to share and amortize cost while communicating. To symbolically
express resource usage in a setting without static data structures and
intrinsic sizes, resource contracts describe bounds that are functions of
interactions between processes. Resource-aware session types combine standard
binary session types and type-based amortized resource analysis in a linear
type system. This type system is formulated for a core session-type calculus of
the language SILL and proved sound with respect to a multiset-based operational
cost semantics that tracks the total number of messages that are exchanged in a
system. The effectiveness of the analysis is demonstrated by analyzing standard
examples from amortized analysis and the literature on session types and by a
comparative performance analysis of different concurrent programs implementing
the same interface.Comment: 25 pages, 2 pages of references, 11 pages of appendix, Accepted at
LICS 201
A Modeling Framework for Schedulability Analysis of Distributed Avionics Systems
This paper presents a modeling framework for schedulability analysis of
distributed integrated modular avionics (DIMA) systems that consist of
spatially distributed ARINC-653 modules connected by a unified AFDX network. We
model a DIMA system as a set of stopwatch automata (SWA) in UPPAAL to analyze
its schedulability by classical model checking (MC) and statistical model
checking (SMC). The framework has been designed to enable three types of
analysis: global SMC, global MC, and compositional MC. This allows an effective
methodology including (1) quick schedulability falsification using global SMC
analysis, (2) direct schedulability proofs using global MC analysis in simple
cases, and (3) strict schedulability proofs using compositional MC analysis for
larger state space. The framework is applied to the analysis of a concrete DIMA
system.Comment: In Proceedings MARS/VPT 2018, arXiv:1803.0866
Regenerative and Adaptive schemes Based on Network Coding for Wireless Relay Network
Recent technological advances in wireless communications offer new
opportunities and challenges for relay network.To enhance system performance,
Demodulate-Network Coding (Dm-NC) scheme has been examined at relay node; it
works directly to De-map the received signals and after that forward the
mixture to the destination. Simulation analysis has been proven that the
performance of Dm-NC has superiority over analog-NC. In addition, the
Quantize-Decode-NC scheme (QDF-NC) has been introduced. The presented
simulation results clearly provide that the QDF-NC perform better than
analog-NC. The toggle between analogNC and QDF-NC is simulated in order to
investigate delay and power consumption reduction at relay node.Comment: 11 pages, 8 figures, International Journal of Computer Networks &
Communications (IJCNC), Vol.4, No.3, May 201
- …