Formal Modeling and Analysis of Timed Systems : 15th International Conference, FORMATS 2017, Berlin, Germany, September 5–7, 2017, Proceedings / / edited by Alessandro Abate, Gilles Geeraerts

• Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
• Edizione: 1st ed. 2017.
• Descrizione fisica: 1 online resource (X, 353 p. 93 illus.)
• Disciplina: 003.3
• Soggetto topico: Algorithms; Software engineering; Compilers (Computer programs); Computer simulation; Computer science; Machine theory; Software Engineering; Compilers and Interpreters; Computer Modelling; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory
• Persona (resp. second.): AbateAlessandro; GeeraertsGilles
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Intro -- Preface -- Organization -- Contents -- Invited Talk -- Euler's Method Applied to the Control of Switched Systems -- 1 Introduction -- 2 Switched Systems and (R, S)-Stability -- 2.1 Switched Systems -- 2.2 (R, S)-Stability -- 2.3 Guaranteed Integration -- 3 Euler's Method and Error Estimation -- 3.1 One-Sided Lipschitz Constant -- 3.2 Euler Approximate Solutions -- 3.3 Application to Control Synthesis for (R,S)-Stability -- 3.4 Avoiding Wrapping Effect with Euler's Method -- 3.5 Numerical Results -- 4 ODEs with Uncertainty -- 4.1 Bounded Uncertainty -- 4.2 Application to Distributed Control Synthesis -- 5 Final Remarks -- References -- Timed Models -- On the Determinization of Timed Systems -- 1 Introduction -- 2 Definitions -- 2.1 Timed Domains -- 2.2 Updates -- 2.3 Automata over Timed Domains -- 2.4 Finite Representation of Automata over Timed Domains -- 2.5 Commands -- 2.6 Different Notions of Determinism -- 3 Determinization of ATD -- 3.1 Full-Command Determinization -- 3.2 Timed-Command Determinization -- 4 Applications -- 4.1 Applications to Plain Timed Automata -- 4.2 Applications to Event-Clock Automata -- 4.3 Application to Perturbed Timed Automata -- 5 Conclusions and Future Work -- References -- On Global Scheduling Independency in Networks of Timed Automata -- 1 Introduction -- 2 Preliminaries -- 3 Non-blocking Operational Semantics -- 4 Deciding Independency from Global Scheduling -- 5 Evaluation -- 6 Conclusion -- References -- Optimal Reachability in Cost Time Petri Nets -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Contribution -- 2 Cost Time Petri Nets -- 2.1 Preliminaries -- 2.2 Time Petri Nets -- 2.3 Cost Time Petri Nets -- 3 Cost State Classes -- 4 Symbolic Algorithm -- 5 Computing the Simple Cost State Classes -- 6 Termination of the Algorithm -- 7 Practical Results. ; 7.1 EPOC (Energy Proportional and Opportunistic Computing systems) -- 8 Conclusion -- References -- Hybrid Systems -- Optimal Control for Multi-mode Systems with Discrete Costs -- 1 Introduction -- 2 Preliminaries -- 2.1 Formal Definition of Multi-mode Systems -- 2.2 Schedules, Their Cost and Safety -- 2.3 Structure of Optimal Schedules -- 2.4 Approximation Algorithms -- 3 Complexity of Limit-Safe and -safe Finite Control -- 4 Structure of Finite Control in One-Dimension -- 5 Complexity of Optimal Control in One-Dimension -- 5.1 Infinite Time Horizon -- 5.2 Finite Time Horizon -- 6 Approximate Optimal Control in One-Dimension -- References -- Augmented Complex Zonotopes for Computing Invariants of Affine Hybrid Systems -- 1 Introduction -- 2 Hybrid Systems and Positive Invariants -- 3 Augmented Complex Zonotopes -- 4 Computation of Positive Invariants -- 5 Experiments -- 6 Conclusion -- References -- Conic Abstractions for Hybrid Systems -- 1 Introduction -- 2 Preliminaries -- 3 Conic Abstractions of Affine Systems -- 3.1 Conic Abstractions Derived from Derivative Space Partitions -- 4 Diagonalizable Systems -- 4.1 Properties of Diagonalizable Systems -- 4.2 Diagonalization and Conic Partition -- 5 Time-Unbounded Reachability Analysis -- 5.1 Mode Switching -- 6 Experiments -- 7 Conclusion -- References -- Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata -- 1 Introduction -- 2 Preliminaries -- 3 Transformations -- 3.1 Direct Time-Triggered Conversion Transformation -- 3.2 Dynamics Scaling Transformation -- 3.3 Combined Scaled Time-Triggered Transformation -- 4 Evaluation -- 5 Related Work -- 6 Conclusion -- References -- Probabilistic Models -- Symbolic Dependency Graphs for PCTL> Model-Checking -- 1 Introduction -- 2 Models and Properties -- 3 Probabilistic Dependency Graphs. ; 4 Probabilistic Symbolic Dependency Graphs -- 5 Conclusion -- References -- Distribution-Based Bisimulation for Labelled Markov Processes -- 1 Introduction -- 1.1 Labelled Markov Processes -- 1.2 Motivation and Related Work -- 2 Subdistribution Bisimulation -- 2.1 Bisimulations for Labelled Markov Processes -- 2.2 Relations of Bisimulations -- 3 Logical Characterisation -- 3.1 Logical Characterisation for Subdistribution Bisimulation -- 3.2 Comparison of Logical Characterisations -- 4 Metrics -- 4.1 Metrics and Approximating Bisimulation -- 4.2 Equivalence Metric for LMP -- 4.3 Linearity and Continuity of Subdistribution Bisimulation -- 4.4 Compositionality -- 5 Conclusion -- References -- Quantitative Logics and Monitoring -- On the Quantitative Semantics of Regular Expressions over Real-Valued Signals -- 1 Introduction -- 2 Signal Regular Expressions -- 3 Properties of the Quantitative Semantics -- 3.1 Robustness Estimate -- 3.2 Star Boundedness -- 4 The Robust Matching Problem -- 4.1 Finite Representation of Signals -- 5 Algorithms -- 6 Experiments -- 7 Conclusion -- References -- Combining the Temporal and Epistemic Dimensions for MTL Monitoring -- 1 Introduction and Motivation -- 2 Preliminaries -- 3 Satisfaction in Two Dimensions -- 4 Case Study -- 5 Conclusions and Future Work -- References -- Efficient Online Timed Pattern Matching by Automata-Based Skipping -- 1 Introduction -- 2 Preliminaries -- 2.1 Timed Pattern Matching -- 2.2 String Matching and the FJS Algorithm -- 3 An FJS-Type Algorithm for Pattern Matching -- 4 An FJS-Type Algorithm for Timed Pattern Matching -- 5 Experiments -- 5.1 Comparison with the Brute Force and BM-Type Algorithms -- 5.2 Comparison with Montre -- 6 Conclusions and Future Work -- References -- Reachability Analysis -- Let's Be Lazy, We Have Time -- 1 Introduction -- 2 Definitions -- 2.1 Timed Automata. ; 2.2 Reachability Problem in Compound Systems -- 2.3 Partial Compound Systems -- 3 From Lazy Reachability to Lazy Reachability with Time -- 3.1 Introductory Example -- 3.2 General Scheme of the Algorithm -- 3.3 Completeness, Concretisation and the CONCRETISE Function -- 3.4 Consistency, Merging and the MERGE Function -- 3.5 Termination, Soundness, Completeness -- 3.6 Example -- 4 Experimental Analysis -- 4.1 Experimental Results -- 4.2 Analysis of the Results -- 5 Conclusion -- References -- Lazy Reachability Checking for Timed Automata Using Interpolants -- 1 Introduction -- 2 Background and Notations -- 2.1 Timed Automata -- 2.2 Symbolic Semantics -- 2.3 Difference Bound Matrices -- 3 Algorithm -- 3.1 Adaptive Simulation Graph -- 3.2 Algorithm -- 4 Abstraction Refinement -- 4.1 Interpolation for Zones -- 4.2 Interpolation Strategies for Abstraction Refinement -- 5 Evaluation -- 6 Conclusions -- References -- Safe Over- and Under-Approximation of Reachable Sets for Delay Differential Equations -- 1 Introduction -- 2 Preliminaries -- 2.1 Nonlinear Control Systems -- 3 Reachable Sets Computation -- 3.1 Sensitivity Analysis Theory -- 3.2 Generating a Constraint Bounding the Time-Lag Term -- 3.3 Constructing Reachable Sets -- 4 Examples and Discussions -- 5 Conclusion -- References -- Testing and Simulation -- Simulation Based Computation of Certificates for Safety of Dynamical Systems -- 1 Introduction -- 2 Problem Description -- 3 Algorithmic Framework -- 4 Computing a Barrier Candidate -- 5 Computing a Counter-Example -- 6 Resulting Algorithm -- 7 Implementation -- 8 Computational Experiments -- 9 Related Work -- 10 Conclusion -- References -- A Symbolic Operational Semantics for TESL -- 1 Introduction -- 2 An Introduction to TESL -- 3 Operational Semantics -- 3.1 Runs -- 3.2 TESL Specifications -- 3.3 Primitives for Run Contexts. ; 3.4 Configurations of the Execution Process -- 3.5 Execution Rules -- 3.6 Termination of a Simulation Step -- 4 Heron: A Solver for TESL Specifications -- 4.1 Conformance Monitoring and Error Detection -- 4.2 Input/output Conformance Testing -- 4.3 Performance -- 5 Conclusion -- References -- Semi-formal Cycle-Accurate Temporal Execution Traces Reconstruction -- 1 Introduction -- 2 Methodology -- 2.1 Overview -- 2.2 Definitions -- 2.3 Footprints Logging -- 2.4 Functional Simulation -- 2.5 Cycle Accurate Trace Reconstruction Algorithm (CATRA) -- 3 Experiments -- 4 Related Work -- 5 Conclusion and Future Work -- References -- Author Index.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 15th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2017, held in Berlin, Germany, in September 2017. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modelling and analysis of timed systems and, as a generalization, hybrid systems.
• Titolo autorizzato: Formal Modeling and Analysis of Timed Systems
• ISBN: 3-319-65765-8
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910483426903321
• Lo trovi qui: Univ. Federico II
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 10419