SearcharxivSearch

arXiv subjects

Stephane Lafortune

Publications and source records attributed to Stephane Lafortune.

15 recordsLinked to original sources

Orbital Stability of Smooth Traveling Solitary Waves to the Fornberg-Whitham Equation

The Fornberg-Whitham (FW) equation was introduced by Fornberg and Whitham [Fornberg and Whitham, Phil. Trans. R. Soc. Lond. A (1978)] as a nonlocal model for unidirectional shallow water waves capable of capturing wave steepening and breaking. Despite its similarities with integrable shallow-water equations, the FW equation is not completely integrable. Nevertheless, the FW equation is part of the family of peakon-type models as it supports peaked traveling wave solutions. In this paper, we consider smooth solitary wave solutions to the FW equation. We use a variational approach to show that some are orbitally stable.

math.AP

PainleveBacklundCheck: A Sympy-powered Kivy app for the Painlev\'e property of nonlinear dispersive PDEs and auto-B\"acklund transformations

In the present work we revisit the Painlev\'e property for partial differential equations. We consider the PDE variant of the relevant algorithm on the basis of the fundamental work of Weiss, Tabor and Carnevale and explore a number of relevant examples. Subsequently, we present an implementation of the relevant algorithm in an open-source platform in Python and discuss the details of a Sympy-powered Kivy app that enables checking of the property and the derivation of associated auto-B{\"a}ck{u}nd transform when the property is present. Examples of the relevant code and its implementation are also provided, as well as details of its open access for interested potential users.

nlin.SI

Stability of smooth solitary waves in the b-Camassa-Holm equation

We derive the precise stability criterion for smooth solitary waves in the b-family of Camassa-Holm equations. The smooth solitary waves exist on the constant background. In the integrable cases b = 2 and b = 3, we show analytically that the stability criterion is satisfied and smooth solitary waves are orbitally stable with respect to perturbations in $H^3(\mathbb{R})$. In the non-integrable cases, we show numerically and asymptotically that the stability criterion is satisfied for every b > 1. The orbital stability theory relies on a different Hamiltonian formulation compared to the Hamiltonian formulations available in the integrable cases.

nlin.PS

Spectral instability of peakons in the b-family of the Camassa--Holm equations

We prove spectral instability of peakons in the $b$-family of Camassa--Holm equations in $L^2(\mathbb{R})$ that includes the integrable cases of $b = 2$ and $b = 3$. We start with a linearized operator defined on functions in $H^1(\mathbb{R}) \cap W^{1,\infty}(\mathbb{R})$ and extend it to a linearized operator defined on weaker functions in $L^2(\mathbb{R})$. For $b \neq \frac{5}{2}$, the spectrum of the linearized operator in $L^2(\mathbb{R})$ is proved to cover a closed vertical strip of the complex plane. For $b = \frac{5}{2}$, the strip shrinks to the imaginary axis, but an additional pair of real eigenvalues exists due to projections to the peakon and its spatial translation. The spectral instability results agree with the linear instability results in the case of the Camassa-Holm equation for $b = 2$.

math.AP

Synthesis of Sensor Deception Attacks at the Supervisory Layer of Cyber-Physical Systems

We study the security of Cyber-Physical Systems (CPS) in the context of the supervisory control layer. Specifically, we propose a general model of a CPS attacker in the framework of discrete event systems and investigate the problem of synthesizing an attack strategy for a given feedback control system. Our model captures a class of deception attacks, where the attacker has the ability to hijack a subset of sensor readings and mislead the supervisor, with the goal of inducing the system into an undesirable state. We utilize a game-like discrete transition structure, called Insertion-Deletion Attack structure (IDA), to capture the interaction between the supervisor and the environment (which includes the system and the attacker). We show how to use IDAs to synthesize three different types of successful stealthy attacks, i.e., attacks that avoid detection from the supervisor and cause damage to the system.

eess.SY

Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement

This paper develops a novel compositional and abstraction-based approach to synthesize edit functions for opacity enforcement in modular discrete event systems. Edit functions alter the output of the system by erasing or inserting events in order to obfuscate the outside intruder, whose goal is to infer the secrets of the system from its observation. We synthesize edit functions to solve the opacity enforcement problem in a modular setting, which significantly reduces the computational complexity compared with the monolithic approach. Two abstraction methods called opaque observation equivalence and opaque bisimulation are first employed to abstract the individual components of the modular system and their observers. Subsequently, we propose a method to transform the synthesis of edit functions to the calculation of modular supremal nonblocking supervisors. We show that the edit functions synthesized in this manner correctly solve the opacity enforcement problem.

cs.CR

Transforming opacity verification to nonblocking verification in modular systems

We consider the verification of current-state and K-step opacity for systems modeled as interacting non-deterministic finite-state automata. We describe a new methodology for compositional opacity verification that employs abstraction, in the form of a notion called opaque observation equivalence, and that leverages existing compositional nonblocking verification algorithms. The compositional approach is based on a transformation of the system, where the transformed system is nonblocking if and only if the original one is current-state opaque. Furthermore, we prove that $K$-step opacity can also be inferred if the transformed system is nonblocking. We provide experimental results where current-state opacity is verified efficiently for a large scaled-up system.

cs.LO

Automated Synthesis of Secure Platform Mappings

System development often involves decisions about how a high-level design is to be implemented using primitives from a low-level platform. Certain decisions, however, may introduce undesirable behavior into the resulting implementation, possibly leading to a violation of a desired property that has already been established at the design level. In this paper, we introduce the problem of synthesizing a property-preserving platform mapping: A set of implementation decisions ensuring that a desired property is preserved from a high-level design into a low-level platform implementation. We provide a formalization of the synthesis problem and propose a technique for synthesizing a mapping based on symbolic constraint search. We describe our prototype implementation, and a real-world case study demonstrating the application of our technique to synthesizing secure mappings for the popular web authorization protocols OAuth 1.0 and 2.0.

cs.SE

Stability of closed solutions to the VFE hierarchy with application to the Hirota equation

The Vortex Filament Equation (VFE) is part of an integrable hierarchy of filament equations. Several equations part of this hierarchy have been derived to describe vortex filaments in various situations. Inspired by these results, we develop a general framework for studying the existence and the linear stability of closed solutions of the VFE hierarchy. The framework is based on the correspondence between the VFE and the nonlinear Schrödinger (NLS) hierarchies. Our results show that it is possible to establish a connection between the AKNS Floquet spectrum and the stability properties of the solutions of the filament equations. We apply our machinery to solutions of the filament equation associated to the Hirota equation. We also discuss how our framework applies to soliton solutions.

nlin.SI

Combustion waves in hydraulically resistant porous media in a special parameter regime

In this paper we study the stability of fronts in a reduction of a well-known PDE system that is used to model the combustion in hydraulically resistant porous media. More precisely, we consider the original PDE system under the assumption that one of the parameters of the model, the Lewis number, is chosen in a specific way and with initial conditions of a specific form. {For a class of initial conditions, then the number of unknown functions is reduced from three to two. For the reduced system, the existence of combustion fronts follows from the existence results for the original system. The stability of these fronts is studied here by a combination of energy estimates and numerical Evans function computations and nonlinear analysis when applicable. We then lift the restriction on the initial conditions and show that the stability results obtained for the reduced system extend to the fronts in the full system considered for that specific value of the Lewis number. The fronts that we {investigate} are proved to be either absolutely unstable or convectively unstable on the nonlinear level.

nlin.PS

Stability analysis for combustion fronts traveling in hydraulically resistant porous media

We study front solutions of a system that models combustion in highly hydraulically resistant porous media. The spectral stability of the fronts is tackled by a combination of energy estimates and numerical Evans function computations. Our results suggest that there is a parameter regime for which there are no unstable eigenvalues. We use recent works about partially parabolic systems to prove that in the absence of unstable eigenvalues the fronts are convectively stable.

nlin.PS

Stability of stationary solutions for nonintegrable peakon equations

The Camassa-Holm equation with linear dispersion was originally derived as an asymptotic equation in shallow water wave theory. Among its many interesting mathematical properties, which include complete integrability, perhaps the most striking is the fact that in the case where linear dispersion is absent it admits weak multi-soliton solutions - "peakons" - with a peaked shape corresponding to a discontinuous first derivative. There is a one-parameter family of generalized Camassa-Holm equations, most of which are not integrable, but which all admit peakon solutions. Numerical studies reported by Holm and Staley indicate changes in the stability of these and other solutions as the parameter varies through the family. In this article, we describe analytical results on one of these bifurcation phenomena, showing that in a suitable parameter range there are stationary solutions - "leftons" - which are orbitally stable.

nlin.PS

Spectral stability of periodic NLS and CGL solutions

We consider periodic traveling wave solutions to the focusing nonlinear Schrodinger equation (NLS) that have been shown to persist when the NLS is perturbed to the complex Ginzburg-Landau equation (CGL). In particular, we show that these periodic traveling waves are spectrally stable solutions of NLS with respect to periodic perturbations. Furthermore, we use an argument based on the Fredholm alternative to find an instability criterion for the persisting solutions to CGL.

nlin.SI

When is negativity not a problem for the ultra-discrete limit?

The `ultra-discrete limit' has provided a link between integrable difference equations and cellular automata displaying soliton like solutions. In particular, this procedure generally turns strictly positive solutions of algebraic difference equations with positive coefficients into corresponding solutions to equations involving the "Max" operator. Although it certainly is the case that dropping these positivity conditions creates potential difficulties, it is still possible for solutions to persist under the ultra-discrete limit even in their absence. To recognize when this will occur, one must consider whether a certain expression, involving a measure of the rates of convergence of different terms in the difference equation and their coefficients, is equal to zero. Applications discussed include the solution of elementary ordinary difference equations, a discretization of the Hirota Bilinear Difference Equation and the identification of integrals of motion for ultra-discrete equations.

nlin.SI

Constructing Integrable Third Order Systems:The Gambier Approach

We present a systematic construction of integrable third order systems based on the coupling of an integrable second order equation and a Riccati equation. This approach is the extension of the Gambier method that led to the equation that bears his name. Our study is carried through for both continuous and discrete systems. In both cases the investigation is based on the study of the singularities of the system (the Painlevé method for ODE's and the singularity confinement method for mappings).

solv-int