Program faults, best known as bugs, are practically unavoidable in today's ever growing software systems. One increasingly popular way of eliminating them, besides tests, dynamic analysis, and fuzzing, is using static analysis based bug-finding tools. Such tools are capable of finding surprisingly sophisticated bugs automatically by inspecting the source code. Their analysis is usually both unsound and incomplete, but still very useful in practice, as they can find non-trivial problems in a reasonable time (e.g. within hours, for an industrial project) without human intervention Because the problems that static analyzers try to solve are hard, usually intractable, they use various approximations that need to be fine-tuned in order to grant a good user experience (i.e. as many interesting bugs with as few distracting false alarms as possible). For each newly introduced heuristic, this normally happens by performing differential testing of the analyzer on a lot of widely used open source software projects that are known to use related language constructs extensively. In practice, this process is ad hoc, error-prone, poorly reproducible and its results are hard to share. We present a set of tools that aim to support the work of static analyzer developers by making differential testing easier. Our framework includes tools for automatic test suite selection, automated differential experiments, coverage information of increased granularity, statistics collection, metric calculations, and visualizations, all resulting in a convenient, shareable HTML report.
{"title":"Report on the Differential Testing of Static Analyzers","authors":"G. Horváth, R. Kovács, Péter Szécsi","doi":"10.14232/actacyb.282831","DOIUrl":"https://doi.org/10.14232/actacyb.282831","url":null,"abstract":"Program faults, best known as bugs, are practically unavoidable in today's ever growing software systems. One increasingly popular way of eliminating them, besides tests, dynamic analysis, and fuzzing, is using static analysis based bug-finding tools. Such tools are capable of finding surprisingly sophisticated bugs automatically by inspecting the source code. Their analysis is usually both unsound and incomplete, but still very useful in practice, as they can find non-trivial problems in a reasonable time (e.g. within hours, for an industrial project) without human intervention\u0000 Because the problems that static analyzers try to solve are hard, usually intractable, they use various approximations that need to be fine-tuned in order to grant a good user experience (i.e. as many interesting bugs with as few distracting false alarms as possible). For each newly introduced heuristic, this normally happens by performing differential testing of the analyzer on a lot of widely used open source software projects that are known to use related language constructs extensively. In practice, this process is ad hoc, error-prone, poorly reproducible and its results are hard to share.\u0000 We present a set of tools that aim to support the work of static analyzer developers by making differential testing easier. Our framework includes tools for automatic test suite selection, automated differential experiments, coverage information of increased granularity, statistics collection, metric calculations, and visualizations, all resulting in a convenient, shareable HTML report.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, numerous interval-based simulation techniques have been developed which allow for a verified computation of outer interval enclosures for the sets of reachable states of dynamic systems represented by finitedimensional sets of ordinary differential equations (ODEs). Here, especially the evaluation of IVPs is of interest, when both the systems’ initial conditions and parameters can only be defined by finitely large domains, often represented by interval boxes. Suitable simulation techniques make use of series expansions of the solutions of IVPs with respect to time and (possibly) the uncertain initial conditions as well as of verified Runge-Kutta techniques. Solution sets are then typically represented by means of multi-dimensional intervals, zonotopes, ellipsoids, or Taylor models, cf. [5]. In most of these approaches, variants of the Picard iteration [1] are involved, which either determine the sets of possible solutions or at least worst-case outer enclosures with which time discretization errors are quantified. An example for a solution routine based entirely on this iteration is the exponential enclosure technique published in [9] and the references therein. It is applicable to systems with nonoscillatory and oscillatory behavior if the solution of the IVP of interest shows an asymptotically stable behavior. For non-oscillatory
{"title":"Toward the Development of Iteration Procedures for the Interval-Based Simulation of Fractional-Order Systems","authors":"A. Rauh, Julia Kersten","doi":"10.14232/actacyb.285660","DOIUrl":"https://doi.org/10.14232/actacyb.285660","url":null,"abstract":"In recent years, numerous interval-based simulation techniques have been developed which allow for a verified computation of outer interval enclosures for the sets of reachable states of dynamic systems represented by finitedimensional sets of ordinary differential equations (ODEs). Here, especially the evaluation of IVPs is of interest, when both the systems’ initial conditions and parameters can only be defined by finitely large domains, often represented by interval boxes. Suitable simulation techniques make use of series expansions of the solutions of IVPs with respect to time and (possibly) the uncertain initial conditions as well as of verified Runge-Kutta techniques. Solution sets are then typically represented by means of multi-dimensional intervals, zonotopes, ellipsoids, or Taylor models, cf. [5]. In most of these approaches, variants of the Picard iteration [1] are involved, which either determine the sets of possible solutions or at least worst-case outer enclosures with which time discretization errors are quantified. An example for a solution routine based entirely on this iteration is the exponential enclosure technique published in [9] and the references therein. It is applicable to systems with nonoscillatory and oscillatory behavior if the solution of the IVP of interest shows an asymptotically stable behavior. For non-oscillatory","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The LLVM Clang Static Analyzer is a source code analysis tool which aims to find bugs in C, C++, and Objective-C programs using symbolic execution, i.e. it simulates the possible execution paths of the code. Currently the simulation of the loops is somewhat naive (but efficient), unrolling the loops a predefined constant number of times. However, this approach can result in a loss of coverage in various cases. This study aims to introduce two alternative approaches which can extend the current method and can be applied simultaneously: (1) determining loops worth to fully unroll with applied heuristics, and (2) using a widening mechanism to simulate an arbitrary number of iteration steps. These methods were evaluated on numerous open source projects, and proved to increase coverage in most of the cases. This work also laid the infrastructure for future loop modeling improvements.
{"title":"Improved Loop Execution Modeling in the Clang Static Analyzer","authors":"Péter Szécsi, G. Horváth, Z. Porkoláb","doi":"10.14232/actacyb.283176","DOIUrl":"https://doi.org/10.14232/actacyb.283176","url":null,"abstract":"The LLVM Clang Static Analyzer is a source code analysis tool which aims to find bugs in C, C++, and Objective-C programs using symbolic execution, i.e. it simulates the possible execution paths of the code. Currently the simulation of the loops is somewhat naive (but efficient), unrolling the loops a predefined constant number of times. However, this approach can result in a loss of coverage in various cases. This study aims to introduce two alternative approaches which can extend the current method and can be applied simultaneously: (1) determining loops worth to fully unroll with applied heuristics, and (2) using a widening mechanism to simulate an arbitrary number of iteration steps. These methods were evaluated on numerous open source projects, and proved to increase coverage in most of the cases. This work also laid the infrastructure for future loop modeling improvements.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127000821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
{"title":"Graph Coloring based Heuristic for Crew Rostering","authors":"L. Hajdu, A. Tóth, Miklós Krész","doi":"10.14232/actacyb.281106","DOIUrl":"https://doi.org/10.14232/actacyb.281106","url":null,"abstract":"In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128065315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Modeling continuous-time dynamical systems is a complex task. Fortunately some dedicated programming languages exist to ease this work. Zelus is one such language that generates a simulation executable which can be used to study the behavior of the modeled system. However, such simulations cannot handle uncertainties on some parameters of the system. This makes it necessary to run multiple simulations to check that the system fulfills particular requirements (safety for instance) for all the values in the uncertainty ranges. Interval-based guaranteed integration methods provide a solution to this problem. The DynIbex library provides such methods but it requires a manual encoding of the system in a general purpose programming language (C++). This article presents an extension of the Zelus compiler to generate interval-based guaranteed simulations of IVPs using DynIbex. This extension is conservative since it does not break the existing compilation workflow.
{"title":"Interval-Based Simulation of Zélus IVPs using DynIbex","authors":"Jason T. Brown, François Pessaux","doi":"10.14232/actacyb.285246","DOIUrl":"https://doi.org/10.14232/actacyb.285246","url":null,"abstract":"Modeling continuous-time dynamical systems is a complex task. Fortunately some dedicated programming languages exist to ease this work. Zelus is one such language that generates a simulation executable which can be used to study the behavior of the modeled system. However, such simulations cannot handle uncertainties on some parameters of the system. This makes it necessary to run multiple simulations to check that the system fulfills particular requirements (safety for instance) for all the values in the uncertainty ranges. Interval-based guaranteed integration methods provide a solution to this problem. The DynIbex library provides such methods but it requires a manual encoding of the system in a general purpose programming language (C++). This article presents an extension of the Zelus compiler to generate interval-based guaranteed simulations of IVPs using DynIbex. This extension is conservative since it does not break the existing compilation workflow.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125023968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Steganography hides the data within a media file in an imperceptible way. Steganalysis exposes steganography by using detection measures. Traditionally, Steganalysis revealed steganography by targeting perceptible and statistical properties which results in developing secure steganography schemes. In this work, we target LSB image steganography by using entropy and joint entropy metrics for steganalysis. First, the Embedded image is processed for feature extraction then analyzed by entropy and joint entropy with their corresponding original image. Second, SVM and Ensemble classifiers are trained according to the analysis results. The decision of classifiers discriminates cover image from stego image. This scheme is further applied on attacked stego image for checking detection reliability. Performance evaluation of proposed scheme is conducted over grayscale image datasets. We analyzed LSB embedded images by Comparing information gain from entropy and joint entropy metrics. Results conclude that entropy of the suspected image is more preserving than joint entropy. As before histogram attack, detection rate with entropy metric is 70% and 98% with joint entropy metric. However after an attack, entropy metric ends with 30% detection rate while joint entropy metric gives 93% detection rate. Therefore, joint entropy proves to be better steganalysis measure with 93% detection accuracy and less false alarms with varying hiding ratio.
{"title":"An Information Theoretic Image Steganalysis for LSB Steganography","authors":"Sonam Chhikara, Rajeev Kumar","doi":"10.14232/actacyb.279174","DOIUrl":"https://doi.org/10.14232/actacyb.279174","url":null,"abstract":"Steganography hides the data within a media file in an imperceptible way. Steganalysis exposes steganography by using detection measures. Traditionally, Steganalysis revealed steganography by targeting perceptible and statistical properties which results in developing secure steganography schemes. In this work, we target LSB image steganography by using entropy and joint entropy metrics for steganalysis. First, the Embedded image is processed for feature extraction then analyzed by entropy and joint entropy with their corresponding original image. Second, SVM and Ensemble classifiers are trained according to the analysis results. The decision of classifiers discriminates cover image from stego image. This scheme is further applied on attacked stego image for checking detection reliability. Performance evaluation of proposed scheme is conducted over grayscale image datasets. We analyzed LSB embedded images by Comparing information gain from entropy and joint entropy metrics. Results conclude that entropy of the suspected image is more preserving than joint entropy. As before histogram attack, detection rate with entropy metric is 70% and 98% with joint entropy metric. However after an attack, entropy metric ends with 30% detection rate while joint entropy metric gives 93% detection rate. Therefore, joint entropy proves to be better steganalysis measure with 93% detection accuracy and less false alarms with varying hiding ratio.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorrespondence decision problem, nowadays known as the Post Correspondence Problem (PCP).Post proved the undecidability of the PCP by areduction from his normal systems. In the presentarticle we follow the steps of Post, and give another, somewhat simpler and more straightforwardproof of the undecidability of the problem by using the same source of reductions as Post did.We investigate these, very different, techniques, and point out out some peculiarities in theapproach used by Post.
{"title":"On the Steps of Emil Post: from Normal Systems to the Correspondence Decision Problem","authors":"Vesa Halava, T. Harju","doi":"10.14232/actacyb.284625","DOIUrl":"https://doi.org/10.14232/actacyb.284625","url":null,"abstract":"In 1946, Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264-268) introduced his famouscorrespondence decision problem, nowadays known as the Post Correspondence Problem (PCP).Post proved the undecidability of the PCP by areduction from his normal systems. In the presentarticle we follow the steps of Post, and give another, somewhat simpler and more straightforwardproof of the undecidability of the problem by using the same source of reductions as Post did.We investigate these, very different, techniques, and point out out some peculiarities in theapproach used by Post.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123733282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-19DOI: 10.14232/actacyb.24.3.2020.16
Hani Dbouk, S. Schön
Reliable confidence domains for positioning with Global Navigation Satellite System (GNSS) and inconsistency measures for the observations are of great importance for any navigation system, especially for safety critical applications. In this work, deterministic error bounds are introduced in form of intervals to assess remaining observation errors. The intervals can be determined based on expert knowledge or - as in our case - based on a sensitivity analysis of the measurement correction process. Using convex optimization, bounding zones are computed for GPS positioning, which satisfy the geometrical constraints imposed by the observation intervals. The bounding zone is a convex polytope. When exploiting only the navigation geometry, a confidence domain is computed in form of a zonotope. We show that the relative volume between the polytope and the zonotope can be considered as an inconsistency measure. A small polytope volume indicates bad consistency of the observations. In extreme cases, empty sets are obtained which indicates large outliers. We explain how shape and volume of the polytopes are related to the positioning geometry. Furthermore, we propose a new concept of Minimum Detectable Biases. Using the example of the Klobuchar ionospheric model and Saastamoinen tropospheric model, we show how observation intervals can be determined via sensitivity analysis of these correction models for a real measurement campaign. Taking GPS code data from simulations and real experiments, a comparison analysis between the proposed deterministic bounding method and the classical least-squares adjustment has been conducted in terms of accuracy and reliability. It shows that the computed polytopes always enclose the reference trajectory. In case of large outliers, large position deviations persist in the least-squares solution while the polytope algorithm yields empty sets and thus successfully detects the cases with outliers.
{"title":"Reliable Bounding Zones and Inconsistency Measures for GPS Positioning using Geometrical Constraints","authors":"Hani Dbouk, S. Schön","doi":"10.14232/actacyb.24.3.2020.16","DOIUrl":"https://doi.org/10.14232/actacyb.24.3.2020.16","url":null,"abstract":"Reliable confidence domains for positioning with Global Navigation Satellite System (GNSS) and inconsistency measures for the observations are of great importance for any navigation system, especially for safety critical applications. In this work, deterministic error bounds are introduced in form of intervals to assess remaining observation errors. The intervals can be determined based on expert knowledge or - as in our case - based on a sensitivity analysis of the measurement correction process. Using convex optimization, bounding zones are computed for GPS positioning, which satisfy the geometrical constraints imposed by the observation intervals. The bounding zone is a convex polytope. When exploiting only the navigation geometry, a confidence domain is computed in form of a zonotope. We show that the relative volume between the polytope and the zonotope can be considered as an inconsistency measure. A small polytope volume indicates bad consistency of the observations. In extreme cases, empty sets are obtained which indicates large outliers. We explain how shape and volume of the polytopes are related to the positioning geometry. Furthermore, we propose a new concept of Minimum Detectable Biases. Using the example of the Klobuchar ionospheric model and Saastamoinen tropospheric model, we show how observation intervals can be determined via sensitivity analysis of these correction models for a real measurement campaign. Taking GPS code data from simulations and real experiments, a comparison analysis between the proposed deterministic bounding method and the classical least-squares adjustment has been conducted in terms of accuracy and reliability. It shows that the computed polytopes always enclose the reference trajectory. In case of large outliers, large position deviations persist in the least-squares solution while the polytope algorithm yields empty sets and thus successfully detects the cases with outliers.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133802735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-19DOI: 10.14232/actacyb.24.3.2020.13
A. Rauh, Julia Kersten
One of the most important advantages of interval observers is their capability to provide estimates for a given dynamic system model in terms of guaranteed state bounds which are compatible with measured data that are subject to bounded uncertainty. However, the inevitable requirement for being able to produce such verified bounds is the knowledge about a dynamic system model in which possible uncertainties and inaccuracies are themselves represented by guaranteed bounds. For that reason, classical point-valued parameter identification schemes are often not sufficient or should, at least, be handled with sufficient care if safety critical applications are of interest. This paper provides an application-oriented description of the major steps leading from a control-oriented system model with an associated verified parameter identification to a verified design of interval observers which provide the basis for the development and implementation of cooperativity-preserving feedback controllers. The corresponding computational steps are described and visualized for the temperature control of a laboratory-scale test rig available at the Chair of Mechatronics at the University of Rostock.
{"title":"From Verified Parameter Identification to the Design of Interval Observers and Cooperativity-Preserving Controllers","authors":"A. Rauh, Julia Kersten","doi":"10.14232/actacyb.24.3.2020.13","DOIUrl":"https://doi.org/10.14232/actacyb.24.3.2020.13","url":null,"abstract":"One of the most important advantages of interval observers is their capability to provide estimates for a given dynamic system model in terms of guaranteed state bounds which are compatible with measured data that are subject to bounded uncertainty. However, the inevitable requirement for being able to produce such verified bounds is the knowledge about a dynamic system model in which possible uncertainties and inaccuracies are themselves represented by guaranteed bounds. For that reason, classical point-valued parameter identification schemes are often not sufficient or should, at least, be handled with sufficient care if safety critical applications are of interest. This paper provides an application-oriented description of the major steps leading from a control-oriented system model with an associated verified parameter identification to a verified design of interval observers which provide the basis for the development and implementation of cooperativity-preserving feedback controllers. The corresponding computational steps are described and visualized for the temperature control of a laboratory-scale test rig available at the Chair of Mechatronics at the University of Rostock.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123029097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-03-19DOI: 10.14232/ACTACYB.24.3.2020.14
C. Zammali, J. V. Gorp, T. Raïssi
State estimation for switched systems with time-varying parameters has received a great attention during the past decades. In this paper, a new approach to design an interval observer for this class of systems is proposed. The scheduling vector is described by a convex combination so that the parametric uncertainties belong into polytopes. The considered system is also subject to measurement noise and state disturbances which are supposed to be unknown but bounded.The proposed method guarantees both cooperativity and Input to State Stability (ISS) of the upper and lower observation errors. Sufficient conditions are given in terms of Linear Matrices Inequalities (LMIs) using a common quadratic Lyapunov function. Finally, a numerical example is provided to show the effectiveness of the designed observer.
{"title":"On Interval Observer Design for Continuous-Time LPV Switched Systems","authors":"C. Zammali, J. V. Gorp, T. Raïssi","doi":"10.14232/ACTACYB.24.3.2020.14","DOIUrl":"https://doi.org/10.14232/ACTACYB.24.3.2020.14","url":null,"abstract":"State estimation for switched systems with time-varying parameters has received a great attention during the past decades. In this paper, a new approach to design an interval observer for this class of systems is proposed. The scheduling vector is described by a convex combination so that the parametric uncertainties belong into polytopes. The considered system is also subject to measurement noise and state disturbances which are supposed to be unknown but bounded.The proposed method guarantees both cooperativity and Input to State Stability (ISS) of the upper and lower observation errors. Sufficient conditions are given in terms of Linear Matrices Inequalities (LMIs) using a common quadratic Lyapunov function. Finally, a numerical example is provided to show the effectiveness of the designed observer.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：