The Experts below are selected from a list of 39114 Experts worldwide ranked by ideXlab platform

Jie Zhong - One of the best experts on this subject based on the ideXlab platform.

  • global robust stability and stabilization of boolean network with disturbances
    Automatica, 2017
    Co-Authors: Jie Zhong
    Abstract:

    Abstract Based on semi-tensor product of matrices, global robust stability and stabilization of Boolean network (BN) with disturbances are investigated. Firstly, the definition of global robust stability for BN with disturbances is presented. By using the Algebraic State space representation of disturbed BN, some necessary and sufficient criteria are obtained to ensure the global robust stability with respect to (w.r.t.) a fixed point or w.r.t. a limit cycle. In contrast, if a given disturbed BN is not globally robust stable w.r.t. a fixed point or w.r.t. a limit cycle, system can achieve stability by a matrix transformation technique. However, it is a difficult task to find such a suitable matrix transformation. In this paper, a pinning State feedback control design is proposed to find a suitable transformation. The obtained results are well illustrated by numerical example.

Nganyewou Tidjon Lionel - One of the best experts on this subject based on the ideXlab platform.

  • Modélisation formelle des systèmes de détection d'intrusions
    'Universite de Sherbrooke', 2020
    Co-Authors: Nganyewou Tidjon Lionel
    Abstract:

    L’écosystème de la cybersécurité évolue en permanence en termes du nombre, de la diversité, et de la complexité des attaques. De ce fait, les outils de détection deviennent inefficaces face à certaines attaques. On distingue généralement trois types de systèmes de détection d’intrusions : détection par anomalies, détection par signatures et détection hybride. La détection par anomalies est fondée sur la caractérisation du comportement habituel du système, typiquement de manière statistique. Elle permet de détecter des attaques connues ou inconnues, mais génère aussi un très grand nombre de faux positifs. La détection par signatures permet de détecter des attaques connues en définissant des règles qui décrivent le comportement connu d’un attaquant. Cela demande une bonne connaissance du comportement de l’attaquant. La détection hybride repose sur plusieurs méthodes de détection incluant celles sus-citées. Elle présente l’avantage d’être plus précise pendant la détection. Des outils tels que Snort et Zeek offrent des langages de bas niveau pour l’expression de règles de reconnaissance d’attaques. Le nombre d’attaques potentielles étant très grand, ces bases de règles deviennent rapidement difficiles à gérer et à maintenir. De plus, l’expression de règles avec état dit Stateful est particulièrement ardue pour reconnaître une séquence d’événements. Dans cette thèse, nous proposons une approche Stateful basée sur les diagrammes d’état-transition algébriques (ASTDs) afin d’identifier des attaques complexes. Les ASTDs permettent de représenter de façon graphique et modulaire une spécification, ce qui facilite la maintenance et la compréhension des règles. Nous étendons la notation ASTD avec de nouvelles fonctionnalités pour représenter des attaques complexes. Ensuite, nous spécifions plusieurs attaques avec la notation étendue et exécutons les spécifications obtenues sur des flots d’événements à l’aide d’un interpréteur pour identifier des attaques. Nous évaluons aussi les performances de l’interpréteur avec des outils industriels tels que Snort et Zeek. Puis, nous réalisons un compilateur afin de générer du code exécutable à partir d’une spécification ASTD, capable d’identifier de façon efficiente les séquences d’événements.Abstract : The cybersecurity ecosystem continuously evolves with the number, the diversity, and the complexity of cyber attacks. Generally, we have three types of Intrusion Detection System (IDS) : anomaly-based detection, signature-based detection, and hybrid detection. Anomaly detection is based on the usual behavior description of the system, typically in a static manner. It enables detecting known or unknown attacks but also generating a large number of false positives. Signature based detection enables detecting known attacks by defining rules that describe known attacker’s behavior. It needs a good knowledge of attacker behavior. Hybrid detection relies on several detection methods including the previous ones. It has the advantage of being more precise during detection. Tools like Snort and Zeek offer low level languages to represent rules for detecting attacks. The number of potential attacks being large, these rule bases become quickly hard to manage and maintain. Moreover, the representation of Stateful rules to recognize a sequence of events is particularly arduous. In this thesis, we propose a Stateful approach based on Algebraic State-transition diagrams (ASTDs) to identify complex attacks. ASTDs allow a graphical and modular representation of a specification, that facilitates maintenance and understanding of rules. We extend the ASTD notation with new features to represent complex attacks. Next, we specify several attacks with the extended notation and run the resulting specifications on event streams using an interpreter to identify attacks. We also evaluate the performance of the interpreter with industrial tools such as Snort and Zeek. Then, we build a compiler in order to generate executable code from an ASTD specification, able to efficiently identify sequences of events

Régine Laleau - One of the best experts on this subject based on the ideXlab platform.

  • Modelling a Hemodialysis Machine Using Algebraic State-Transition Diagrams and B-like Methods
    2016
    Co-Authors: Thomas Fayolle, Marc Frappier, Frédéric Gervais, Régine Laleau
    Abstract:

    This paper presents the specification of the hemodialysis case study, proposed by ABZ’16 conference. The specification was carried out by a coupling of Algebraic State-Transition Diagrams (astd) and B-like methods. astd are a graphical notation, based on automata and process algebra operators. They provide an easy-to-read specification of the dynamic behaviour of the system. The data model is specified using the Event-B language. The system is incrementally designed using extended refinement of both methods.

  • Extending Statecharts with process algebra operators
    Innovations in Systems and Software Engineering, 2008
    Co-Authors: Marc Frappier, Frédéric Gervais, Régine Laleau, Benoît Fraikin, Richard St-denis
    Abstract:

    This paper describes an adaptation of Statecharts to take advantage of process algebra operators like those found in CSP and EB3. The resulting notation is called Algebraic State transition diagrams (ASTDs). The process algebra operators considered include sequence, iteration, parallel composition, and quantified synchronization. Quantification is one of the salient features of ASTDs, because it provides a powerful mechanism to precisely and explicitly define cardinalities in a dynamic model. The formal semantics of ASTDs is expressed using the operational style typically used in process algebras. The target application domain is the specification and implementation of information systems.

Daizhan Cheng - One of the best experts on this subject based on the ideXlab platform.

  • Canonical Form of Boolean Networks
    2019 Chinese Control Conference (CCC), 2019
    Co-Authors: Daizhan Cheng
    Abstract:

    Based on the Algebraic State space representation of logical dynamic systems, a canonical form of Boolean networks is proposed. This form reveals the topological structure of Boolean networks. Two numerical algorithms are proposed. One is used for small networks and the other one is used for large scale networks. Some numerical examples are presented to demonstrate the normal form and the algorithms.

  • semi tensor product approach to networked evolutionary games
    Control Theory and Technology, 2014
    Co-Authors: Daizhan Cheng, Hairong Dong
    Abstract:

    In this paper a comprehensive introduction for modeling and control of networked evolutionary games (NEGs) via semi-tensor product (STP) approach is presented. First, we review the mathematical model of an NEG, which consists of three ingredients: network graph, fundamental network game, and strategy updating rule. Three kinds of network graphs are considered, which are i) undirected graph for symmetric games; ii) directed graph for asymmetric games, and iii) d-directed graph for symmetric games with partial neighborhood information. Three kinds of fundamental evolutionary games (FEGs) are discussed, which are i) two strategies and symmetric (S-2); ii) two strategies and asymmetric (A-2); and iii) three strategies and symmetric (S-3). Three strategy updating rules (SUR) are introduced, which are i) Unconditional Imitation (UI); ii) Fermi Rule(FR); iii) Myopic Best Response Adjustment Rule (MBRA). First, we review the fundamental evolutionary equation (FEE) and use it to construct network profile dynamics (NPD)of NEGs. To show how the dynamics of an NEG can be modeled as a discrete time dynamics within an Algebraic State space, the fundamental evolutionary equation (FEE) of each player is discussed. Using FEEs, the network strategy profile dynamics (NSPD) is built by providing efficient algorithms. Finally, we consider three more complicated NEGs: i) NEG with different length historical information, ii) NEG with multi-species, and iii) NEG with time-varying payoffs. In all the cases, formulas are provided to construct the corresponding NSPDs. Using these NSPDs, certain properties are explored. Examples are presented to demonstrate the model constructing method, analysis and control design technique, and to reveal certain dynamic behaviors of NEGs.

Fuad E Alsaadi - One of the best experts on this subject based on the ideXlab platform.

  • Algebraic formulation and topological structure of boolean networks with State dependent delay
    Journal of Computational and Applied Mathematics, 2019
    Co-Authors: Yating Zheng, Fuad E Alsaadi
    Abstract:

    Abstract This paper investigates the Algebraic formulation, topological structure and set stability of Boolean networks with State-dependent delay (SDD). Firstly, using the Algebraic State space representation (ASSR) method, the dynamics of Boolean networks with SDD is converted into an equivalent augmented system. Secondly, based on the equivalent augmented system, some necessary and sufficient conditions are presented to calculate fixed points and cycles of Boolean networks with SDD. Thirdly, it is proved that the set stability of Boolean networks with SDD is equivalent to the set stability of augmented system, and a necessary and sufficient condition is presented by constructing a kind of set stability matrix. Finally, the obtained results are applied to the strategy consensus of networked evolutionary games with memories.