AVERIST: An Algorithmic Verifier for Stability
نویسندگان
چکیده
In this paper, we present the tool AVERIST, which implements an algorithmic approach for the stability analysis of polyhedral switched systems. It implements an abstraction based model-checking approach proposed in the earlier work of the authors. The tool constructs a weighted graph abstracting the polyhedral hybrid system, and analyzes the graph to infer stability. In the case that the hybrid system is unstable, it also returns an abstract counterexample in the weighted graph indicating a potential reason for failure.
منابع مشابه
Counterexample Guided Abstraction Refinement for Stability Analysis
In this paper, we present a counterexample guided abstraction refinement (Cegar) algorithm for stability analysis of polyhedral hybrid systems. Our results build upon a quantitative predicate abstraction and model-checking algorithm for stability analysis, which returns a counterexample indicating a potential reason for instability. The main contributions of this paper include the validation of...
متن کاملConvertible limited (multi-) verifier signature: new constructions and applications
A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...
متن کاملAn Efficient Strong Designated Verifier Signature Scheme
This paper proposes a designated verifier signature scheme based on the Schnorr signature and the Zheng signcryption schemes. One of the advantages of the new scheme compared with all previously proposed schemes is that it achieves the “strong designated verifier” property without encrypting any part of the signatures. This is because the designated verifier’s secret key is involved in the veri...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملUniversal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions
Universal designated verifier signatures (UDVS) were introduced in 2003 by Steinfeld et al. to allow signature holders to monitor the verification of a given signature in the sense that any plain signature can be publicly turned into a signature which is only verifiable by some specific designated verifier. Privacy issues, like non-dissemination of digital certificates, are the main motivations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 317 شماره
صفحات -
تاریخ انتشار 2015