105,632 research outputs found
Consensus over ring networks as a quadratic optimal control problem
This paper presents the consensus problem in the framework of optimal control. Our aim is to synchronize a set of identical linear systems. We propose a cost which penalizes mutual differences between the states of these systems. The feedback matrix resulting from this linear quadratic control problem represents the interconnection network which synchronizes the systems. In general the interconnection structure is of the all-to-all type. We show that it is possible to devise an LQR problem in which the cost results in an interconnection structure representing ring coupling. Care has to be taken that the effect of the feedback control is restricted to synchronizing the systems, i.e. when the systems are synchronized, the feedback control signal is required to be equal to zero
Parameterized Synthesis
We study the synthesis problem for distributed architectures with a
parametric number of finite-state components. Parameterized specifications
arise naturally in a synthesis setting, but thus far it was unclear how to
detect realizability and how to perform synthesis in a parameterized setting.
Using a classical result from verification, we show that for a class of
specifications in indexed LTL\X, parameterized synthesis in token ring networks
is equivalent to distributed synthesis in a network consisting of a few copies
of a single process. Adapting a well-known result from distributed synthesis,
we show that the latter problem is undecidable. We describe a semi-decision
procedure for the parameterized synthesis problem in token rings, based on
bounded synthesis. We extend the approach to parameterized synthesis in
token-passing networks with arbitrary topologies, and show applicability on a
simple case study. Finally, we sketch a general framework for parameterized
synthesis based on cutoffs and other parameterized verification techniques.Comment: Extended version of TACAS 2012 paper, 29 page
A Systematic Review of Tracing Solutions in Software Product Lines
Software Product Lines are large-scale, multi-unit systems that enable
massive, customized production. They consist of a base of reusable artifacts
and points of variation that provide the system with flexibility, allowing
generating customized products. However, maintaining a system with such
complexity and flexibility could be error prone and time consuming. Indeed, any
modification (addition, deletion or update) at the level of a product or an
artifact would impact other elements. It would therefore be interesting to
adopt an efficient and organized traceability solution to maintain the Software
Product Line. Still, traceability is not systematically implemented. It is
usually set up for specific constraints (e.g. certification requirements), but
abandoned in other situations. In order to draw a picture of the actual
conditions of traceability solutions in Software Product Lines context, we
decided to address a literature review. This review as well as its findings is
detailed in the present article.Comment: 22 pages, 9 figures, 7 table
Sequential Synthesis of Distributed Controllers for Cascade Interconnected Systems
We consider the problem of designing distributed controllers to ensure
passivity of a large-scale interconnection of linear subsystems connected in a
cascade topology. The control design process needs to be carried out at the
subsystem-level with no direct knowledge of the dynamics of other subsystems in
the interconnection. We present a distributed approach to solve this problem,
where subsystem-level controllers are locally designed in a sequence starting
at one end of the cascade using only the dynamics of the particular subsystem,
coupling with the immediately preceding subsystem and limited information from
the preceding subsystem in the cascade to ensure passivity of the
interconnected system up to that point. We demonstrate that this design
framework also allows for new subsystems to be compositionally added to the
interconnection without requiring redesign of the pre-existing controllers.Comment: Accepted to appear in the proceedings of the American Control
Conference (ACC) 201
A Sub-optimal Algorithm to Synthesize Control Laws for a Network of Dynamic Agents
We study the synthesis problem of an LQR controller when the matrix describing the control law is constrained to lie in a particular vector space. Our motivation is the use of such control laws to stabilize networks of autonomous agents in a decentralized fashion; with the information flow being dictated by the constraints of a pre-specified topology. In this paper, we consider the finite-horizon version of the problem and provide both a computationally intensive optimal solution and a sub-optimal solution that is computationally more tractable. Then we apply the technique to the decentralized vehicle formation control problem and show that the loss in performance due to the use of the sub-optimal solution is not huge; however the topology can have a large effect on performance
Distributed Control of Positive Systems
A system is called positive if the set of non-negative states is left
invariant by the dynamics. Stability analysis and controller optimization are
greatly simplified for such systems. For example, linear Lyapunov functions and
storage functions can be used instead of quadratic ones. This paper shows how
such methods can be used for synthesis of distributed controllers. It also
shows that stability and performance of such control systems can be verified
with a complexity that scales linearly with the number of interconnections.
Several results regarding scalable synthesis and verfication are derived,
including a new stronger version of the Kalman-Yakubovich-Popov lemma for
positive systems. Some main results are stated for frequency domain models
using the notion of positively dominated system. The analysis is illustrated
with applications to transportation networks, vehicle formations and power
systems
On the Automated Synthesis of Enterprise Integration Patterns to Adapt Choreography-based Distributed Systems
The Future Internet is becoming a reality, providing a large-scale computing
environments where a virtually infinite number of available services can be
composed so to fit users' needs. Modern service-oriented applications will be
more and more often built by reusing and assembling distributed services. A key
enabler for this vision is then the ability to automatically compose and
dynamically coordinate software services. Service choreographies are an
emergent Service Engineering (SE) approach to compose together and coordinate
services in a distributed way. When mismatching third-party services are to be
composed, obtaining the distributed coordination and adaptation logic required
to suitably realize a choreography is a non-trivial and error prone task.
Automatic support is then needed. In this direction, this paper leverages
previous work on the automatic synthesis of choreography-based systems, and
describes our preliminary steps towards exploiting Enterprise Integration
Patterns to deal with a form of choreography adaptation.Comment: In Proceedings FOCLASA 2015, arXiv:1512.0694
- …