{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":44,"n_cols":5,"rows_kept":44,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[17,2,17,3],[18,2,18,3],[22,2,22,3],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[26,4,26,5],[27,2,27,3],[28,2,28,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3],[37,2,37,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465474403316"]
[null,null,"Titolo",null,"Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 13th International Conference, TACAS 2007 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007 Proceedings / / edited by Orna Grumberg, Michael Huth"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"1-280-95188-5"]
[{"$nulls":4},"9786610951888"]
[{"$nulls":4},"3-540-71209-7"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (755 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4424"]
[null,null,"Disciplina",null,"004.21"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Computer Communication Networks"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"... the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2007)\"--Pref."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Contributions -- THERE AND BACK AGAIN: Lessons Learned on the Way to the Market -- Verifying Object-Oriented Software: Lessons and Challenges -- Software Verification -- Shape Analysis by Graph Decomposition -- A Reachability Predicate for Analyzing Low-Level Software -- Generating Representation Invariants of Structurally Complex Data -- Probabilistic Model Checking and Markov Chains -- Multi-objective Model Checking of Markov Decision Processes -- PReMo: An Analyzer for Probabilistic Recursive Models -- Counterexamples in Probabilistic Model Checking -- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking -- Static Analysis -- Causal Dataflow Analysis for Concurrent Programs -- Type-Dependence Analysis and Program Transformation for Symbolic Execution -- JPF–SE: A Symbolic Execution Extension to Java PathFinder "]
[{"$nulls":4},"-- Markov Chains and Real-Time Systems -- A Symbolic Algorithm for Optimal Markov Chain Lumping -- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations -- Model Checking Probabilistic Timed Automata with One or Two Clocks -- Adaptor Synthesis for Real-Time Components -- Timed Automata and Duration Calculus -- Deciding an Interval Logic with Accumulated Durations -- From Time Petri Nets to Timed Automata: An Untimed Approach -- Complexity in Simplicity: Flexible Agent-Based State Space Exploration -- On Sampling Abstraction of Continuous Time Logic with Durations -- Assume-Guarantee Reasoning -- Assume-Guarantee Synthesis -- Optimized L*-Based Assume-Guarantee Reasoning -- Refining Interface Alphabets for Compositional Verification -- MAVEN: Modular Aspect Verification -- Biological Systems -- Model Checking Liveness Properties of Genetic Regulatory Networks -- Checking Pedigree Consistency with PCS -- “Don’t Care” Modeling: A Logical Framework for Developing Predictive System Models -- Abstraction Refinement -- Deciding Bit-Vector Arithmetic with Abstraction -- Abstraction Refinement of Linear Programs with Arrays -- Property-Driven Partitioning for Abstraction Refinement -- Combining Abstraction Refinement and SAT-Based Model Checking -- Message Sequence Charts -- Detecting Races in Ensembles of Message Sequence Charts -- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning -- Automata-Based Model Checking -- Improved Algorithms for the Automata-Based Approach to Model-Checking -- GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae -- Faster Algorithms for Finitary Games -- Specification Languages -- Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, -- motor:The modest Tool Environment -- Syntactic Optimizations for PSL Verification -- The Heterogeneous Tool Set, Hets -- Security -- Searching for Shapes in Cryptographic Protocols -- Automatic Analysis of the Security of XOR-Based Key Management Schemes -- Software and Hardware Verification -- State of the Union: Type Inference Via Craig Interpolation -- Hoare Logic for Realistically Modelled Machine Code -- VCEGAR: Verilog CounterExample Guided Abstraction Refinement -- Decision Procedures and Theorem Provers -- Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications -- Combined Satisfiability Modulo Parametric Theories -- A Gröbner Basis Approach to CNF-Formulae Preprocessing -- Kodkod: A Relational Model Finder -- Model Checking -- Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams -- Model Checking on Trees with Path Equivalences -- Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking -- Distributed Analysis with ?CRL: A Compendium of Case Studies -- Infinite-State Systems -- A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes -- Unfolding Concurrent Well-Structured Transition Systems -- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)."]
[null,"2.","Record Nr.",null,"UNINA9910438044603321"]
[null,null,"Autore",null,"White Andrew P"]
[null,null,"Titolo",null,"Linear parameter-varying control for engineering applications / / Andrew P. White, Guoming Zhu, Jongeun Choi"]
[null,null,"Pubbl/distr/stampa",null,"London ; ; New York, : Springer, c2013"]
[null,null,"ISBN",null,"9781447150404"]
[{"$nulls":4},"1447150406"]
[null,null,"Edizione",null,"[1st ed. 2013.]"]
[null,null,"Descrizione fisica",null,"1 online resource (xiii, 110 pages) : illustrations"]
[null,null,"Collana",null,"SpringerBriefs in electrical and computer engineering, Control, automation and robotics, , 2191-8112"]
[null,null,"Disciplina",null,"629.8"]
[null,null,"Soggetti",null,"Linear control systems"]
[{"$nulls":4},"Automation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"ISSN: 2192-6786.\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Introduction -- Linear Parameter-Varying Modeling and Control Synthesis Methods -- Weight Selection and Tuning -- Gain-Scheduling Control of Port-Fuel-Injection Processes -- Mixed H2/H-infinity Observer-Based LPV Control of a Hydraulic Engine Cam Phasing Actuator."]
[null,null,null,"Sommario/riassunto","The objective of this brief is to carefully illustrate a procedure of applying linear parameter-varying (LPV) control to a class of dynamic systems via a systematic synthesis of gain-scheduling controllers with guaranteed stability and performance. The existing LPV control theories rely on the use of either H-infinity or H2 norm to specify the performance of the LPV system.  The challenge that arises with LPV control for engineers is twofold. First, there is no systematic procedure for applying existing LPV control system theory to solve practical engineering problems from modeling to control design. Second, there exists no LPV control synthesis theory to design LPV controllers with hard constraints. For example, physical systems usually have hard constraints on their required performance outputs along with their sensors and actuators. Furthermore, the H-infinity and H2 performance criteria cannot provide hard constraints on system outputs. As a result, engineers in industry could find it difficult to utilize the current LPV methods in practical applications. To address these challenges, gain-scheduling control with engineering applications is covered in detail, including the LPV modeling, the control problem formulation, and the LPV system performance specification. In addition, a new performance "]
[{"$nulls":4},"specification is considered which is capable of providing LPV control design with hard constraints on system outputs. The LPV design and control synthesis procedures in this brief are illustrated through an engine air-to-fuel ratio control system, an engine variable valve timing control system, and an LPV control design example with hard constraints. After reading this brief, the reader will be able to apply a collection of LPV control synthesis techniques to design gain-scheduling controllers for their own engineering applications. This brief provides detailed step-by-step LPV modeling and control design strategies along with a new performance specification so that engineers can apply state-of-the-art LPV control synthesis to solve their own engineering problems. In addition, this brief should serve as a bridge between the H-infinity and H2 control theory and the real-world application of gain-scheduling control."]