LEADER 09975nam 2200529 450 001 996485665403316 005 20230113164508.0 010 $a3-031-15839-3 035 $a(MiAaPQ)EBC7078240 035 $a(Au-PeEL)EBL7078240 035 $a(CKB)24750399800041 035 $a(PPN)264191587 035 $a(EXLCZ)9924750399800041 100 $a20230113d2022 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aFormal modeling and analysis of timed systems $e20th international conference, FORMATS 2022, Warsaw, Poland, September 13-15, 2022, proceedings /$fSergiy Bogomolov, David Parker (editors) 210 1$aCham, Switzerland :$cSpringer,$d[2022] 210 4$d©2022 215 $a1 online resource (315 pages) 225 1 $aLecture notes in computer science ;$vVolume 13465 311 08$aPrint version: Bogomolov, Sergiy Formal Modeling and Analysis of Timed Systems Cham : Springer International Publishing AG,c2022 9783031158384 327 $aIntro -- Preface -- Organization -- Abstracts -- A Behaviour-Based Approach to Quantitative Validation of Cyber-Physical Systems -- A Personal History of Formal Modeling and Analysis of Timed Systems Before There was FORMATS -- Contents -- Invited Papers -- Algebraic Model Checking for Discrete Linear Dynamical Systems -- 1 Introduction -- 1.1 Skolem Oracles -- 1.2 Main Results -- 2 Algebraic Model Checking -- 3 Conclusion -- References -- Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? -- 1 Introduction -- 2 Birth of Timed Automata for Verification: The Early 90's -- 2.1 Preliminaries -- 2.2 The Timed Automaton Model ch2AD90,ch2AD94 -- 3 A Symbolic Approach to the Verification of Timed Automata -- 3.1 Zones and Symbolic Forward Computation -- 3.2 Difference Bounded Matrices (DBMs) -- 3.3 Efficiency of the Forward Analysis -- 4 Extrapolation: A First Solution -- 4.1 The First Extrapolation Operator -- 4.2 Two Refinements of This Approach -- 4.3 Problems with Diagonal Clock Constraints -- 5 Simulation: An Alternative Solution -- 6 Beyond Reachability -- 6.1 Weighted Timed Automata -- 6.2 Liveness Properties -- 7 Tools -- 7.1 A Tool for Verifying Timed Automata: Uppaal -- 7.2 The Tool TChecker -- 8 What Next? -- 8.1 BDD and SAT Based Methods -- 8.2 The Local-Time Semantics and Partial-Order Reduction -- 8.3 Domain-Specific Algorithms -- 8.4 Richer Models -- References -- Monitoring Timed Properties (Revisited) -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Monitoring in a Timed Setting -- 5 Time Divergence -- 6 A Symbolic Method for Monitoring -- 7 Time Uncertainty -- 8 Time Predictive Monitoring -- 9 Conclusion -- References -- Probabilistic and Timed Systems -- Bounded Delay Timed Channel Coding -- 1 Introduction -- 2 Preliminary Work -- 2.1 Timed Languages and Timed Automata. 327 $a2.2 Entropy and Capacity -- 2.3 Pseudo-Distance on Timed Languages -- 2.4 The Factor Language -- 3 Bandwidth -- 3.1 Definitions -- 3.2 Examples -- 3.3 Existence of Limits -- 4 Encodings -- 4.1 Definition -- 4.2 Necessary Condition -- 4.3 Sufficient Condition -- 5 Conclusion and Further Work -- References -- Robustly Complete Finite-State Abstractions for Verification of Stochastic Systems -- 1 Introduction -- 2 Preliminaries -- 2.1 Canonical Sample Space -- 2.2 Markov Transition Systems -- 2.3 Weak Convergence and Prokhorov's Theorem -- 2.4 Discrete-Time Continuous-State Stochastic Systems -- 2.5 Robust Abstractions -- 3 Soundness of Robust IMC Abstractions -- 3.1 Weak Compactness of Marginal Space Mt of Probabilities -- 3.2 Weak Compactness of Probability Laws of I on Infinite Horizon -- 3.3 Soundness of IMC Abstractions -- 4 Robust Completeness of IMC Abstractions -- 5 Conclusion -- References -- Model Checking for Entanglement Swapping -- 1 Introduction -- 2 Preliminaries -- 2.1 Probabilistic Timed Automata -- 3 Modeling and Validation -- 3.1 The PTA Model -- 3.2 Validation Through Simulations -- 4 Experimental Setup -- 5 Results -- 6 Discussions and Outlook -- References -- Temporal Logic -- An STL-Based Formulation of Resilience in Cyber-Physical Systems -- 1 Introduction -- 2 Preliminaries -- 3 Specifying Resilience in STL -- 3.1 Resiliency Specification Language -- 3.2 Semantics of Resiliency Specifications -- 4 Case Study -- 4.1 UAV Package Delivery -- 4.2 Multi-agent Flocking -- 5 Related Work -- 6 Conclusion -- References -- MITL Verification Under Timing Uncertainty -- 1 Introduction -- 2 Preliminaries -- 2.1 Set Theory -- 2.2 Topology -- 3 Problem Formulation -- 3.1 Syntax and Semantics of MITL -- 3.2 Truth Sets and Interval Queues -- 4 Interval Queue Fundamentals -- 4.1 Construction Algorithm -- 4.2 Complementation Algorithm. 327 $a5 Verification Procedure -- 5.1 Operators in the Interval Queue Domain -- 5.2 Constructing Under- and Over-Approximations -- 5.3 Conservativeness -- 6 Numerical Example -- 7 Conclusion -- A Proof of Theorem 1 -- References -- Classification of Driving Behaviors Using STL Formulas: A Comparative Study -- 1 Introduction -- 2 Preliminaries -- 3 Specifying Longitudinal Driving Behavior with STL -- 4 Methods -- 5 Experiments -- 6 Discussion and Conclusions -- References -- Timed Automata and Games -- Timed Games with Bounded Window Parity Objectives -- 1 Introduction -- 2 Preliminaries -- 3 Bounded Window Objectives -- 4 Verification of Timed Automata -- 5 Solving Timed Games -- References -- Non-blind Strategies in Timed Network Congestion Games -- 1 Introduction -- 2 Preliminaries -- 2.1 Timed Network Congestion Game -- 2.2 Studied Problems -- 3 Existence and Computation of Nash Equilibria -- 3.1 Transformation into an Equivalent Finite Concurrent Game -- 3.2 Existence of Nash Equilibria -- 3.3 Computation of Nash Equilibria -- 4 Social Optimality and Prices of Anarchy and Stability -- 4.1 Constrained-Social-Welfare Problem: Asymmetric Case -- 4.2 Constrained-Social-Welfare Problem: Symmetric Case -- 4.3 Social Optimum and Prices of Anarchy and Stability -- References -- Efficient Convex Zone Merging in Parametric Timed Automata -- 1 Introduction -- 2 Preliminaries -- 3 Efficient State Merging in Parametric Timed Automata -- 3.1 Merging Algorithm -- 3.2 Heuristics for Merging -- 3.3 Preservation of Properties -- 4 Experiments -- 4.1 Dataset and Experimental Environment -- 4.2 Description of the Experiments -- 5 Conclusion -- A Results for All Heuristics on the Full Benchmark -- References -- Neural Networks -- Neural Network Repair with Reachability Analysis -- 1 Introduction -- 2 Deep Neural Network Repair -- 2.1 Provably Safe DNNs. 327 $a2.2 DNN Agent Repair for Deep Reinforcement Learning -- 2.3 Computation of Exact Unsafe Domain of ReLU DNNs -- 3 Framework for DNN Repair -- 3.1 Formulation of Loss Function for Problems 1 & -- 2 -- 3.2 Repair for Deep Reinforcement Learning -- 4 Experiments and Evaluation -- 4.1 Repair of ACAS Xu Neural Network Controllers -- 4.2 Rocket Lander Benchmark -- 5 Conclusion and Future Work -- References -- On Neural Network Equivalence Checking Using SMT Solvers -- 1 Introduction -- 2 Preliminaries: Neural Networks -- 2.1 Notation -- 2.2 Neural Networks -- 3 Strict and Approximate Equivalences for Neural Networks -- 3.1 Strict Neural Network Equivalence -- 3.2 Approximate Neural Network Equivalences Based on Lp Norms -- 3.3 Approximate Neural Network Equivalences Based on Order of Outputs -- 3.4 Hybrid Lp-argsort Equivalences -- 3.5 The Neural Network Equivalence Checking Problem -- 3.6 Discussion of Application Domains for the Above Equivalence Relations -- 4 Neural Network Equivalence Checking Using SMT Solvers -- 4.1 Encoding Neural Networks as SMT Formulas -- 4.2 Encoding of the Equivalence Relation -- 4.3 Optimizing the Encoding -- 5 Experimental Results -- 5.1 Sanity Checks -- 5.2 Equivalence Checking -- 6 Related Work -- 7 Conclusions -- References -- Reachability Analysis of a General Class of Neural Ordinary Differential Equations -- 1 Introduction -- 2 Background and Problem Formulation -- 2.1 General Neural ODE -- 2.2 NODE: Applications -- 2.3 Reachability Analysis -- 2.4 Reachability Methods -- 3 Evaluation -- 3.1 Method and Tool Comparison -- 3.2 Case Study: Adaptive Cruise Control (ACC) -- 3.3 Classification NODEs -- 4 Related Work -- 5 Conclusion and Future Work -- References -- Reinforcement Learning -- Robust Event-Driven Interactions in Cooperative Multi-agent Learning -- 1 Introduction -- 1.1 Main Contribution -- 2 Preliminaries. 327 $a2.1 Notation -- 2.2 MDPs and Multi-agent MDPs -- 2.3 Value Functions and Q-Learning in c-MMDPs -- 3 Information Sharing Between Collaborative Agents: Problem Formulation -- 4 Efficient Communication Strategies -- 4.1 Event-Driven Interactions -- 5 Robustness Surrogate and Its Computation -- 5.1 Learning the Robustness Surrogate with the Scenario Approach -- 6 Experiments -- 6.1 Benchmark: Collaborative Particle-Tag -- 6.2 Computation of Robustness Surrogates -- 6.3 Results -- 7 Discussion -- References -- Learning that Grid-Convenience Does Not Hurt Resilience in the Presence of Uncertainty -- 1 Introduction -- 2 Case Study -- 3 Methodology -- 4 Results -- 5 Reproducibility and Conclusions -- References -- Author Index. 410 0$aLecture notes in computer science ;$vVolume 13465. 606 $aComputer simulation$vCongresses 606 $aFormal methods (Computer science) $vCongresses 606 $aSystem analysis$vCongresses 615 0$aComputer simulation 615 0$aFormal methods (Computer science) 615 0$aSystem analysis 676 $a003.3 702 $aBogomolov$b Sergiy 702 $aParker$b David 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996485665403316 996 $aFormal Modeling and Analysis of Timed Systems$9772562 997 $aUNISA LEADER 02775nam 2200613 450 001 9910793732203321 005 20230120090847.0 010 $a84-9180-466-8 010 $a84-9180-465-X 035 $a(CKB)4100000009152029 035 $a(MiAaPQ)EBC5885392 035 $a(OCoLC)1126312436 035 $a(FINmELB)ELB117488 035 $a(MiAaPQ)EBC7026143 035 $a(Au-PeEL)EBL7026143 035 $a(EXLCZ)994100000009152029 100 $a20230120d2019 uy 0 101 0 $aspa 135 $aurcnu|||||||| 181 $ctxt$2rdamedia/spa 182 $cc$2rdamedia/spa 183 $2rdacarrier/spa 200 13$aEl mitin en Espan?a $ede la plaza de toros a la sen?al institucional /$fRafael Sa?nchez Sa?nchez ; pro?logo de Jorge Marti?nez Reverte 205 $aPrimera edicio?n en lengua castellana. 210 1$aBarcelona :$cEditorial UOC,$d[2019] 210 4$d©2019 215 $a1 recurso en li?nea (237 pa?ginas) 225 1 $aComunicacio?n ;$v622 300 $aContiene anexos. 311 $a84-9180-464-1 320 $aIncludes bibliographical references. 330 $aLa Segunda República, etapa histórica en la que prestigiosos oradores consiguieron llenar plazas de toros y grandes recintos deportivos, es el punto de partida de un recorrido por la evolución del mitin como evento de propaganda política imprescindible en las campañas electorales. Rafael Sánchez analiza en este libro los cambios experimentados por estos actos de masas tanto al albor de los avances tecnológicos como del uso, por parte del PSOE y el PP, de medios audiovisuales propios para grabar y difundir las imágenes de sus mítines en las televisiones. El autor desvela, además, anécdotas de la trastienda de los mítines desconocidas hasta ahora y contadas de primera mano por sus protagonistas. 410 0$aManuales (Editorial UOC).$pComunicacio?n ;$v622. 606 $aPolitical oratory 606 $aPolitical oratory$zSpain$xHistory 606 $aRhetoric$xPolitical aspects$zSpain$xHistory 606 $aPolitical campaigns$zSpain$xHistory 606 $aMass media$xPolitical aspects$zSpain$xHistory 606 $aCommunication in politics$zSpain$xHistory 615 0$aPolitical oratory. 615 0$aPolitical oratory$xHistory. 615 0$aRhetoric$xPolitical aspects$xHistory. 615 0$aPolitical campaigns$xHistory. 615 0$aMass media$xPolitical aspects$xHistory. 615 0$aCommunication in politics$xHistory. 676 $a808.51088329 700 $aSa?nchez Sa?nchez$b Rafael$f1954-$01538794 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910793732203321 996 $aEl mitin en Espan?a$93789164 997 $aUNINA LEADER 01562nas 2200433-a 450 001 9910896099003321 005 20230326213021.0 035 $a(DE-599)ZDB2701341-8 035 $a(CKB)110985822454052 035 $a(CONSER)---86650242- 035 $a(EXLCZ)99110985822454052 100 $a20760401a19639999 --- b 101 0 $ager 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aJahrbuch der Heidelberger Akademie der Wissenschaften für .. 210 $aHeidelberg $cC. Winter 210 3 $aHeidelberg $cHeidelberger Akademie der Wissenschaften 215 $a1 online resource 311 08$aPrint version: Jahrbuch der Heidelberger Akademie der Wissenschaften für ... 0341-2865 (DLC) 86650242 (OCoLC)2084041 517 1 $aJahrbuch 531 0 $aJahrb. Heidelb. Akad. Wiss. 606 $aSchool yearbooks$vPeriodicals 606 $aSchool yearbooks$2fast$3(OCoLC)fst01107930 606 $aHeidelberger Akademie der Wissenschaften$2gtt 606 $aInstituciones científicas$zAlemania$vPublicaciones periódicas$2embne 608 $aPeriodicals.$2fast 615 0$aSchool yearbooks 615 7$aSchool yearbooks. 615 17$aHeidelberger Akademie der Wissenschaften. 615 7$aInstituciones científicas 676 $a053/.1 712 02$aHeidelberger Akademie der Wissenschaften. 906 $aJOURNAL 912 $a9910896099003321 920 $aexl_impl conversion 996 $aJahrbuch der Heidelberger Akademie der Wissenschaften für .$94236346 997 $aUNINA