Download or read book TECHNIQUES SYMBOLIQUES POUR LA REDUCTION DES AUTOMATES D ETATS FINIS ET APPLICATION A LA VERIFICATION FORMELLE MODULAIRE ET L OPTIMISATION DE CIRCUITS SEQUENTIELS VLSI COMPLEXES written by FAHIM.. RAHIM and published by . This book was released on 1999 with total page 156 pages. Available in PDF, EPUB and Kindle. Book excerpt: LES CIRCUITS VLSI (VERY LARGE SCALE INTEGRATION) SONT UTILISES DE MANIERE TRES COURANTE DANS LES PRODUITS ELECTRONIQUES MODERNES. DEPUIS LA CREATION DU PREMIER CIRCUIT INTEGRE EN 1959, LE NOMBRE DE TRANSISTORS UTILISE POUR FABRIQUER UN CHIP A DOUBLE PRATIQUEMENT TOUS LES ANS. COMME LA COMPLEXITE ET LES PERFORMANCES REQUISES DES VLSI ONT AUGMENTE DE MANIERE EXPONENTIELLE, LE PROCESSUS DE DESIGN A ETE RENDU AUTOMATIQUE EN UTILISANT DES OUTILS DE CAO (CONCEPTION ASSISTEE PAR ORDINATEUR). UN OUTIL DE CAO EST UN PROGRAMME QUE PEUT UTILISER LE CONCEPTEUR D'UN CIRCUIT INTEGRE DANS LE PROCESSUS DE DESIGN D'UN VLSI. CETTE THESE CHERCHE A RESOUDRE LE PROBLEME DE LA VERIFICATION FORMELLE AUTOMATIQUE D'UNE CLASSE DE CIRCUITS DIGITAUX, CE QUI EST UN ELEMENT CLE DE L'AUTOMATISATION DE CE PROCESSUS. NOUS NOUS INTERESSONS PLUS PARTICULIEREMENT AUX TECHNIQUES DITES DE MODEL-CHECKING QUI PERMETTENT DE DEMONTRER AUTOMATIQUEMENT SI UN CIRCUIT SE COMPORTE DE LA MANIERE VOULUE. CETTE THESE PRESENTE PLUSIEURS METHODES DITES D'ABSTRACTION OU REDUCTION POUR PERMETTRE LA VERIFICATION DE MODELE SUR DES CIRCUITS DE GRANDE TAILLE. EN OUTRE NOUS PRESENTONS EN ANNEXE DE CETTE THESE COMMENT LES TECHNIQUES MISES EN UVRE POUR LE MODEL-CHECKING PEUVENT ETRE AUSSI UTILISEES POUR LA SYNTHESE DE CIRCUITS SEQUENTIELS, NOTAMMENT POUR L'EVALUATION DE LA CONSOMMATION ET L'OPTIMISATION EN VUE DE REDUIRE LA CONSOMMATION.
Download or read book SYNTHESE D AUTOMATES D ETATS FINI POUR LES CIRCUITS INTEGRES VLSI written by M. CHAKER.. SARWARY and published by . This book was released on 1995 with total page 136 pages. Available in PDF, EPUB and Kindle. Book excerpt: CETTE THESE PROPOSE UNE METHODE PERMETTANT D'OPTIMISER LE CODAGE D'ETATS DES AUTOMATES D'ETATS FINI EN VUE DE LA SYNTHESE. LES DEUX POINTS IMPORTANTS DE CETTE METHODE SONT: 1. UN PARCOURS ALEATOIRE SOUS CONTRAINTE DE L'ESPACE DES CODAGES: CETTE ETAPE A POUR OBJECTIF DE SELECTIONNER UN CERTAIN NOMBRE DE CODAGES SUPPOSES MEILLEURS. L'APPROCHE CONSISTE A PROGRESSER DANS L'ESPACE DE MANIERE ALEATOIRE, ET POUR CHAQUE SOLUTION ATTEINTE, AMELIORER CELLE-CI, EN EFFECTUANT DES TRANSPOSITIONS DE CODES, EN TENANT COMPTE DE LA TOPOLOGIE DU GRAPHE D'ETATS REPRESENTANT L'AUTOMATE A CODER. CETTE RECHERCHE EST MISE EN UVRE POUR ETRE RAPIDE EN TEMPS DE CALCUL AFIN DE LAISSER SUFFISAMMENT DE TEMPS POUR LA PROCEDURE D'EVALUATION DU COUT. 2. UNE PROCEDURE D'EVALUATION DU COUT: CETTE PROCEDURE DONNE LE COUT DE LA REALISATION DE L'AUTOMATE POUR UNE IMPLANTATION EN LOGIQUE MULTI-NIVEAUX A BASE D'UNE BIBLIOTHEQUE DE CELLULES PRECARACTERISEES. POUR REPONDRE AUX DEUX CRITERES IMPORTANTS D'UNE FONCTION DE COUT, LA FIDELITE ET LA RAPIDITE, ELLE SE BASE SUR UNE FORME GRAPHIQUE DE REPRESENTATION D'UN RESEAU BOOLEEN APPELE GRAPHES D'EXPRESSIONS FACTORISEES. CETTE APPROCHE PERMET D'EVITER L'ETAPE DE RE-ORDONNANCEMENT DES VARIABLES D'ENTREE, QUI EST L'ETAPE LA PLUS COUTEUSE EN TEMPS DE CALCUL DANS LES METHODES DE SYNTHESE GRAPHIQUE. POUR LA SYNTHESE D'AUTOMATES COMPLEXES, CETTE THESE PROPOSE UNE DESCRIPTION HIERARCHIQUE POUVANT ETRE IMPLANTE PAR UN AUTOMATE A PILE. POUR CELA, UN SOUS ENSEMBLE VHDL EST DEFINI QUI PERMET DE DECRIRE CE TYPE D'AUTOMATES. LES AUTOMATES A PILE SONT ABORDES SELON LES ASPECTS SUIVANTS: FACILITE DE DESCRIPTION OFFERTE AUX CONCEPTEURS, COMPARAISON D'UNE REALISATION AVEC UNE PILE ET UNE REALISATION SANS PILE D'UN MEME AUTOMATE (LORSQUE CECI EST POSSIBLE), ET L'IMPACT DE LA PILE SUR LE CODAGE D'ETATS
Download or read book Techniques de v rification bas es sur des repr sentations symboliques par automates et l abstraction guid e par les contre exemples written by Pierre Moro and published by . This book was released on 2008 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Cette thèse étudie les techniques de vérification automatiques de propriétés d'accessibilité pour des programmes représentées symboliquement par des automates. Les ensembles de configurations des programmes sont représentés par des automates tandis que les instructions sont représentées par des transducteurs. Calculer l'ensemble des états accessibles est à la base de la vérification de propriétés de sûreté. C'est un problème indécidable, le calcul itératif naïf ne termine pas en général. Il faut alors utiliser des techniques permettant d'accélérer ce calcul. Une des techniques principalement étudiée consiste à sur-approximer les ensembles accessibles afin de forcer la convergence du calcul. Ces sur-approximations peuvent induire des comportements n'existant pas dans le programme réel pour lesquelles la propriété à vérifier serait fausse. Dans ce cas, nous testons, si les contre-exemples appartiennent au programme réel, et dans le cas où ces contre-exemples ne seraient dus qu'à la sur-approximation, nous automatisons des raffinements des abstractions. Partant de cette méthodologie, nous proposons des techniques afin de vérifier les programmes séquentiel, sans récursion, mais manipulant des listes chaînées. Nous développons alors des techniques permettant dans un premier temps d'exprimer les configurations mémoires de tels programmes sous forme d'automates, et les instructions sous formes de transducteurs. Nous développons ensuite des des techniques de sur-approximation adaptées à ce type particulier d'automates. Nous montrons ensuite que de tels programmes peuvent être vus comme des automates à compteurs, i.e., que seuls quelques points des tas mémoires (qui sont en nombre finis) sont relevant et que des compteurs indiquant le nombre d'éléments entre ces points permettent de donner une représentation du comportement du programme. Nous développons ensuite des techniques de vérification d'automates à compteurs, en utilisant des techniques d'abstraction-vérificaiton-raffinement pour ce type d'automates. Nous avons développé un outil permettant la vérification de tels programmes. Dans un second temps, nous étudions le problème de la taille des contre-exemples sur des automates de Bùchi représentant le produitentre une formule de logique temporelle linéaire et un automate fini. Les contre-exemples permettent la correction des programmes, et il est important de pouvoir travailler sur des contre-exemples les plus petits possibles. De tels algorithmes nécessitent de d'optimiser l'espace mémoire utilisé pour le stockage des éléments tout en essayant de garder une complexité en temps acceptable
Download or read book VERIFICATION FORMELLE D EQUIVALENCE DES SYSTEMES DIGITAUX SEQUENTIELS PAR SIMULATION SYMBOLIQUE written by GERD.. RITTER and published by . This book was released on 2001 with total page 160 pages. Available in PDF, EPUB and Kindle. Book excerpt: NOUS PROPOSONS UNE NOUVELLE METHODOLOGIE DE SIMULATION SYMBOLIQUE, PERMETTANT LA VERIFICATION DES CIRCUITS SEQUENTIELS DECRITS A DES NIVEAUX D'ABSTRACTION DIFFERENTS. NOUS AVONS UTILISE UN OUTIL AUTOMATIQUE DE VERIFICATION FORMELLE AFIN DE MONTRER L'EQUIVALENCE ENTRE UNE DESCRIPTION STRUCTURELLE PRECISANT LES DETAILS DE REALISATION ET SA SPECIFICATION COMPORTEMENTALE. DES DESCRIPTIONS AU NIVEAU PORTES LOGIQUES ISSUES D'UN OUTIL DE SYNTHESE COMMERCIAL ONT ETE COMPAREES A DES SPECIFICATIONS COMPORTEMENTALES ET STRUCTURELLES AU NIVEAU TRANSFERT DE REGISTRES. CEPENDANT, IL N'EST PAS NECESSAIRE QUE LA SPECIFICATION SOIT SYNTHETISABLE NI QU'ELLE SOIT EQUIVALENTE A LA REALISATION A CHAQUE CYCLE D'HORLOGE. ULTERIEUREMENT CETTE METHODE POURRA AUSSI S'APPLIQUER A LA VERIFICATION DES PROPRIETES. LA SIMULATION SYMBOLIQUE EST EXECUTEE EN SUIVANT DES CHEMINS DONT L'OUTIL GARANTIT LA COHERENCE LOGIQUE. NOUS OBTENONS UN BON COMPROMIS ENTRE PRECISION ET VITESSE EN DETECTANT DES EQUIVALENCES GRACE A UN ENSEMBLE EXTENSIBLE DE TECHNIQUES. NOUS UTILISONS DES DIAGRAMMES DE DECISIONS BINAIRES (OBDD) POUR DETECTER LES EQUIVALENCES DANS CERTAINS CAS PARTICULIERS. NOUS EVITONS L'EXPLOSION COMBINATOIRE EN UTILISANT LES RESULTATS DES AUTRES TECHNIQUES DE DETECTION ET EN NE REPRESENTANT QU'UNE PETITE PARTIE DU PROBLEME A VERIFIER PAR DES DIAGRAMMES DE DECISIONS. LA COOPERATION DE TOUTES LES TECHNIQUES, ET LA GENERATION DE TRACES PERMETTANT LA CORRECTION D'ERREURS, ONT ETE RENDUES POSSIBLES PAR LE FAIT QUE NOUS ASSOCIONS DES RELATIONS A DES CLASSES D'EQUIVALENCE, AU LIEU DE MANIPULER DES EXPRESSIONS SYMBOLIQUES.
Download or read book Topological Data Analysis for Scientific Visualization written by Julien Tierny and published by Springer. This book was released on 2018-01-16 with total page 158 pages. Available in PDF, EPUB and Kindle. Book excerpt: Combining theoretical and practical aspects of topology, this book provides a comprehensive and self-contained introduction to topological methods for the analysis and visualization of scientific data. Theoretical concepts are presented in a painstaking but intuitive manner, with numerous high-quality color illustrations. Key algorithms for the computation and simplification of topological data representations are described in detail, and their application is carefully demonstrated in a chapter dedicated to concrete use cases. With its fine balance between theory and practice, "Topological Data Analysis for Scientific Visualization" constitutes an appealing introduction to the increasingly important topic of topological data analysis for lecturers, students and researchers.
Download or read book A Construction Manual for Robots Ethical Systems written by Robert Trappl and published by Springer. This book was released on 2015-11-26 with total page 211 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book will help researchers and engineers in the design of ethical systems for robots, addressing the philosophical questions that arise and exploring modern applications such as assistive robots and self-driving cars. The contributing authors are among the leading academic and industrial researchers on this topic and the book will be of value to researchers, graduate students and practitioners engaged with robot design, artificial intelligence and ethics.
Download or read book Physical Modeling for Virtual Manufacturing Systems and Processes written by Jan C. Aurich and published by Trans Tech Publications Ltd. This book was released on 2017-08-30 with total page 274 pages. Available in PDF, EPUB and Kindle. Book excerpt: The 1st Conference on Physical Modeling for Virtual Manufacturing Systems and Processes is the result of the International Research Training Group (IRTG) 2057 "Physical Modeling for Virtual Manufacturing Systems and Processes", funded by the German Research Foundation (DFG). The IRTG began on 01 July 2014. Partner University of the University of Kaiserslautern, is the University of California, with its locations in Berkeley and Davis. At the conference the progress and the results of the first cohort of PhD students was presented. The conference was complemented by talks of international guest speakers from computer science and manufacturing engineering. The proceedings contain 22 peer-reviewed papers on Physical Modeling for Virtual Manufacturing Systems and Processes.
Download or read book Designing Scientific Applications on GPUs written by Raphael Couturier and published by CRC Press. This book was released on 2013-11-21 with total page 496 pages. Available in PDF, EPUB and Kindle. Book excerpt: Many of today's complex scientific applications now require a vast amount of computational power. General purpose graphics processing units (GPGPUs) enable researchers in a variety of fields to benefit from the computational power of all the cores available inside graphics cards.Understand the Benefits of Using GPUs for Many Scientific Applications
Download or read book Mathematical Software ICMS 2014 written by Hoon Hong and published by Springer. This book was released on 2014-08-01 with total page 762 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 4th International Conference on Mathematical Software, ICMS 2014, held in Seoul, South Korea, in August 2014. The 108 papers included in this volume were carefully reviewed and selected from 150 submissions. The papers are organized in topical sections named: invited; exploration; group; coding; topology; algebraic; geometry; surfaces; reasoning; special; Groebner; triangular; parametric; interfaces and general.
Download or read book Symbolic Numeric Computation written by Dongming Wang and published by Springer Science & Business Media. This book was released on 2007-01-22 with total page 391 pages. Available in PDF, EPUB and Kindle. Book excerpt: The growing demand of speed, accuracy, and reliability in scientific and engineering computing has been accelerating the merging of symbolic and numeric computations. These two types of computation coexist in mathematics yet are separated in traditional research of mathematical computation. This book presents 27 research articles on the integration and interaction of symbolic and numeric computation.
Download or read book Inconsistency Robustness written by Carl Hewitt and published by . This book was released on 2015-05-20 with total page 614 pages. Available in PDF, EPUB and Kindle. Book excerpt: Inconsistency robustness is information system performance in the face of continually pervasive inconsistencies---a shift from the previously dominant paradigms of inconsistency denial and inconsistency elimination attempting to sweep them under the rug. Inconsistency robustness is a both an observed phenomenon and a desired feature: Inconsistency Robustness is an observed phenomenon because large information-systems are required to operate in an environment of pervasive inconsistency. Inconsistency Robustness is a desired feature because we need to improve the performance of large information system. This volume has revised versions of refereed articles and panel summaries from the first two International Symposia on Inconsistency Robustness conducted under the auspices of the International Society for Inconsistency Robustness (iRobust http: //irobust.org). The articles are broadly based on theory and practice, addressing fundamental issues in inconsistency robustness. The field of Inconsistency Robustness aims to provide practical rigorous foundations for computer information systems dealing with pervasively inconsistent information."
Download or read book Solving Polynomial Equations written by Alicia Dickenstein and published by Springer Science & Business Media. This book was released on 2005-04-27 with total page 433 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a general introduction to modern mathematical aspects in computing with multivariate polynomials and in solving algebraic systems. It presents the state of the art in several symbolic, numeric, and symbolic-numeric techniques, including effective and algorithmic methods in algebraic geometry and computational algebra, complexity issues, and applications ranging from statistics and geometric modelling to robotics and vision. Graduate students, as well as researchers in related areas, will find an excellent introduction to currently interesting topics. These cover Groebner and border bases, multivariate resultants, residues, primary decomposition, multivariate polynomial factorization, homotopy continuation, complexity issues, and their applications.
Download or read book Effective Methods in Algebraic Geometry written by Teo Mora and published by Springer Science & Business Media. This book was released on 1991 with total page 524 pages. Available in PDF, EPUB and Kindle. Book excerpt: On Lack of Effectiveness in Semi-algebraic Geometry.- A simple constructive proof of Canonical Resolution of Singularities.- Local Membership Problems for Polynomial Ideals.- Un Algorithme pour le Calcul des Résultants.- On algorithms for real algebraic plane curves.- Duality methods for the membership problem.- Exemples d'ensembles de Points en Position Uniforme.- Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets.- Noetherian Properties and Growth of some Associative Algebras.- Codes and Elliptic Curves.- Algorithmes - disons rapides - pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionnelles.- Complexity of Solving Systems of Linear Equations over the Rings of Differential Operators.- Membership problem, Representation problem and the Computation of the Radical for one-dimensional Ideals.- On the Complexity of Zero-dimensional Algebraic Systems.- A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals.- Algorithms for a Multiple Algebraic Extension.- Elementary constructive theory of ordered fields.- Effective real Nullstellensatz and variants.- Algorithms for the Solution of Systems of Linear Equations in Commutative Rings.- Une conjecture sur les anneaux de Chow A(G, ?) renforcée par un calcul formel.- Construction de courbes de genre 2 à partir de leurs modules.- Computing Syzygies à la Gau?-Jordan.- The non-scalar Model of Complexity in Computational Geometry.- Géométrie et Interpretations Génériques, un Algorithme.- Canonical Bases: Relations with Standard Bases, Finiteness Conditions and Application to Tame Automorphisms.- The tangent cone algorithm and some applications to local algebraic geometry.- Effective Methods for Systems of Algebraic Partial Differential Equations.- Finding roots of equations involving functions defined by first order algebraic differential equations.- Some Effective Methods in the Openness of Loci for Cohen-Macaulay and Gorenstein Properties.- Sign determination on zero dimensional sets.- A Classification of Finite-dimensional Monomial Algebras.- An algorithm related to compactifications of adjoint groups.- Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time.
Download or read book Computer Algebra and Polynomials written by Jaime Gutierrez and published by Springer. This book was released on 2015-01-20 with total page 222 pages. Available in PDF, EPUB and Kindle. Book excerpt: Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life. This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects. The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.
Download or read book Mathematical Software ICMS 2016 written by Gert-Martin Greuel and published by Springer. This book was released on 2016-07-06 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 5th International Conference on Mathematical Software, ICMS 2015, held in Berlin, Germany, in July 2016. The 68 papers included in this volume were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections named: univalent foundations and proof assistants; software for mathematical reasoning and applications; algebraic and toric geometry; algebraic geometry in applications; software of polynomial systems; software for numerically solving polynomial systems; high-precision arithmetic, effective analysis, and special functions; mathematical optimization; interactive operation to scientific artwork and mathematical reasoning; information services for mathematics: software, services, models, and data; semDML: towards a semantic layer of a world digital mathematical library; miscellanea.
