Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computational methods in systems biology : 18th International Conference, CMSB 2020, Konstanz, Germany, September 23-25, 2020, Proceedings / / Alessandro Abate, Tatjana Petrov, Verena Wolf, editors
| Computational methods in systems biology : 18th International Conference, CMSB 2020, Konstanz, Germany, September 23-25, 2020, Proceedings / / Alessandro Abate, Tatjana Petrov, Verena Wolf, editors |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XIX, 387 p. 208 illus., 57 illus. in color.) |
| Disciplina | 572.80285 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Bioinformatics |
| ISBN | 3-030-60327-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modelling and Analysis -- Rate Equations For Graphs -- Stationary Distributions and Metastable Behaviour for Self-Regulating Proteins with General Lifetime Distributions -- Accelerating Reactions at the DNA Can Slow Down Transient Gene Expression -- Graphical Conditions for Rate Independence in Chemical Reaction Networks -- Interval Constraint Satisfaction and Optimization for Biological Homeostasis and Multistationarity -- Growth Dependent Computation of Chokepoints in Metabolic Networks -- On the Complexity of Quadratization for Polynomial Differential Equations -- Comparing Probabilistic and Logic Programming Approaches to Predict the Effects of Enzymes in a Neurogenerative Disease Model -- Boolean Networks -- Control Strategy Identification via Trap Spaces in Boolean Networks -- Qualitative Analysis of Mammalian Circadian Oscillations: Cycle Dynamics and Robustness -- Synthesis and Simulation of Ensembles of Boolean Networks for Cell Fate Decision -- Classifier Construction in Boolean Networks Using Algebraic Methods -- Sequential Temporary and Permanent Control of Boolean Networks -- Inference and Identification -- ABC(SMC)^2: Simultaneous Inference and Model Checking of Chemical Reaction Networks -- Parameter Synthesis for Hybrid Systems from Hybrid CTL Specifications -- Core Models of Receptor Reactions Evaluate Basic Pathway Designs Enabling Heterogeneous Commitments to Apoptosis -- Drawing the Line: Basin Boundaries in Safe Petri Nets -- Tools -- ModRev - Model Revision Tool for Boolean Logical Models of Biological Regulatory Networks -- fnyzer: a Python Package for the Analysis of Flexible Nets -- eBCSgen: A Software Tool for Biochemical Space Language -- What is a Cell Cycle Checkpoint ? The TotemBioNet Answer -- Kaemika App, Integrating Protocols and Chemical Simulation -- Tutorials -- Tutorial: The CoLoMoTo Interactive Notebook, Accessible and Reproducible Computational Analyses for Qualitative Biological Networks -- Integrating Experimental Pharmacology and Systems Biology for GPCR Drug Discovery. |
| Record Nr. | UNISA-996418316803316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational methods in systems biology : 18th International Conference, CMSB 2020, Konstanz, Germany, September 23-25, 2020, Proceedings / / Alessandro Abate, Tatjana Petrov, Verena Wolf, editors
| Computational methods in systems biology : 18th International Conference, CMSB 2020, Konstanz, Germany, September 23-25, 2020, Proceedings / / Alessandro Abate, Tatjana Petrov, Verena Wolf, editors |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XIX, 387 p. 208 illus., 57 illus. in color.) |
| Disciplina | 572.80285 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Bioinformatics |
| ISBN | 3-030-60327-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modelling and Analysis -- Rate Equations For Graphs -- Stationary Distributions and Metastable Behaviour for Self-Regulating Proteins with General Lifetime Distributions -- Accelerating Reactions at the DNA Can Slow Down Transient Gene Expression -- Graphical Conditions for Rate Independence in Chemical Reaction Networks -- Interval Constraint Satisfaction and Optimization for Biological Homeostasis and Multistationarity -- Growth Dependent Computation of Chokepoints in Metabolic Networks -- On the Complexity of Quadratization for Polynomial Differential Equations -- Comparing Probabilistic and Logic Programming Approaches to Predict the Effects of Enzymes in a Neurogenerative Disease Model -- Boolean Networks -- Control Strategy Identification via Trap Spaces in Boolean Networks -- Qualitative Analysis of Mammalian Circadian Oscillations: Cycle Dynamics and Robustness -- Synthesis and Simulation of Ensembles of Boolean Networks for Cell Fate Decision -- Classifier Construction in Boolean Networks Using Algebraic Methods -- Sequential Temporary and Permanent Control of Boolean Networks -- Inference and Identification -- ABC(SMC)^2: Simultaneous Inference and Model Checking of Chemical Reaction Networks -- Parameter Synthesis for Hybrid Systems from Hybrid CTL Specifications -- Core Models of Receptor Reactions Evaluate Basic Pathway Designs Enabling Heterogeneous Commitments to Apoptosis -- Drawing the Line: Basin Boundaries in Safe Petri Nets -- Tools -- ModRev - Model Revision Tool for Boolean Logical Models of Biological Regulatory Networks -- fnyzer: a Python Package for the Analysis of Flexible Nets -- eBCSgen: A Software Tool for Biochemical Space Language -- What is a Cell Cycle Checkpoint ? The TotemBioNet Answer -- Kaemika App, Integrating Protocols and Chemical Simulation -- Tutorials -- Tutorial: The CoLoMoTo Interactive Notebook, Accessible and Reproducible Computational Analyses for Qualitative Biological Networks -- Integrating Experimental Pharmacology and Systems Biology for GPCR Drug Discovery. |
| Record Nr. | UNINA-9910427693603321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 15th International Conference, FORMATS 2017, Berlin, Germany, September 5–7, 2017, Proceedings / / edited by Alessandro Abate, Gilles Geeraerts
| Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 15th International Conference, FORMATS 2017, Berlin, Germany, September 5–7, 2017, Proceedings / / edited by Alessandro Abate, Gilles Geeraerts |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 353 p. 93 illus.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| 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 |
| ISBN | 3-319-65765-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNISA-996466170203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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
| 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 |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 353 p. 93 illus.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| 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 |
| ISBN | 3-319-65765-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNINA-9910483426903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid Systems Biology [[electronic resource] ] : Fourth International Workshop, HSB 2015, Madrid, Spain, September 4-5, 2015. Revised Selected Papers / / edited by Alessandro Abate, David Safranek
| Hybrid Systems Biology [[electronic resource] ] : Fourth International Workshop, HSB 2015, Madrid, Spain, September 4-5, 2015. Revised Selected Papers / / edited by Alessandro Abate, David Safranek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIV, 249 p. 78 illus. in color.) |
| Disciplina | 572.8 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Computer logic
Computer simulation Bioinformatics Data mining Artificial intelligence Computer communication systems Logics and Meanings of Programs Simulation and Modeling Computational Biology/Bioinformatics Data Mining and Knowledge Discovery Artificial Intelligence Computer Communication Networks |
| ISBN | 3-319-26916-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Statistical analysis -- Analysis and verification of continuous and hybrid models -- Quantitative analysis of biological models -- Application of advanced models on case studies. |
| Record Nr. | UNISA-996466231003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Hybrid Systems Biology : Fourth International Workshop, HSB 2015, Madrid, Spain, September 4-5, 2015. Revised Selected Papers / / edited by Alessandro Abate, David Safranek
| Hybrid Systems Biology : Fourth International Workshop, HSB 2015, Madrid, Spain, September 4-5, 2015. Revised Selected Papers / / edited by Alessandro Abate, David Safranek |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIV, 249 p. 78 illus. in color.) |
| Disciplina | 572.8 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Computer logic
Computer simulation Bioinformatics Data mining Artificial intelligence Computer communication systems Logics and Meanings of Programs Simulation and Modeling Computational Biology/Bioinformatics Data Mining and Knowledge Discovery Artificial Intelligence Computer Communication Networks |
| ISBN | 3-319-26916-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Statistical analysis -- Analysis and verification of continuous and hybrid models -- Quantitative analysis of biological models -- Application of advanced models on case studies. |
| Record Nr. | UNINA-9910484597803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Numerical Software Verification [[electronic resource] ] : 10th International Workshop, NSV 2017, Heidelberg, Germany, July 22-23, 2017, Proceedings / / edited by Alessandro Abate, Sylvie Boldo
| Numerical Software Verification [[electronic resource] ] : 10th International Workshop, NSV 2017, Heidelberg, Germany, July 22-23, 2017, Proceedings / / edited by Alessandro Abate, Sylvie Boldo |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 115 p. 23 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Algorithms Machine theory Computer simulation Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Modelling |
| ISBN | 3-319-63501-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verified Computations using Taylor Models and Their Applications -- Introduction to the IEEE 1788-2015 Standard for Interval Arithmetic -- Formal Correctness of Comparison Algorithms between binary64 and decimal64 Floating-Point Numbers -- Sound Numerical Computations in Abstract Acceleration -- Studying the numerical quality of an industrial computing code: a case study on Code_Aster -- Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees -- Rigorous Reachability Analysis and Domain Decomposition of Taylor Models -- A Study of Model-Order Reduction Techniques for Verification. |
| Record Nr. | UNISA-996466319603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Numerical Software Verification : 10th International Workshop, NSV 2017, Heidelberg, Germany, July 22-23, 2017, Proceedings / / edited by Alessandro Abate, Sylvie Boldo
| Numerical Software Verification : 10th International Workshop, NSV 2017, Heidelberg, Germany, July 22-23, 2017, Proceedings / / edited by Alessandro Abate, Sylvie Boldo |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 115 p. 23 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Algorithms Machine theory Computer simulation Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Modelling |
| ISBN | 3-319-63501-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Verified Computations using Taylor Models and Their Applications -- Introduction to the IEEE 1788-2015 Standard for Interval Arithmetic -- Formal Correctness of Comparison Algorithms between binary64 and decimal64 Floating-Point Numbers -- Sound Numerical Computations in Abstract Acceleration -- Studying the numerical quality of an industrial computing code: a case study on Code_Aster -- Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees -- Rigorous Reachability Analysis and Domain Decomposition of Taylor Models -- A Study of Model-Order Reduction Techniques for Verification. |
| Record Nr. | UNINA-9910483484303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Quantitative Evaluation of Systems [[electronic resource] ] : 18th International Conference, QEST 2021, Paris, France, August 23–27, 2021, Proceedings / / edited by Alessandro Abate, Andrea Marin
| Quantitative Evaluation of Systems [[electronic resource] ] : 18th International Conference, QEST 2021, Paris, France, August 23–27, 2021, Proceedings / / edited by Alessandro Abate, Andrea Marin |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (469 pages) |
| Disciplina | 004.24 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science - Mathematics Mathematical statistics Artificial intelligence Software engineering Algorithms Machine theory Theory of Computation Probability and Statistics in Computer Science Artificial Intelligence Software Engineering Formal Languages and Automata Theory |
| ISBN | 3-030-85172-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Speaker -- Performance Evaluation: Model-Driven or Problem-Driven? -- Probabilistic Model Checking -- A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking -- Tweaking the Odds in Probabilistic Timed Automata -- Quantifying Software Reliability via Model-Counting -- Quantitative Models and Metamodels: Analysis and Validation -- Compositional safe approximation of response time distribution of complex workflows -- Transient Analysis of Hierarchical Semi-Markov Process Models with Tool Support in Stateflow -- Evaluating the Effectiveness of Metamodels in Emulating Quantitative Models -- Queueing Systems -- Network Calculus for Bounding Delays in Feedforward Networks of FIFO Queueing Systems -- SEH: Size Estimate Hedging for Single-Server Queues -- An Approximate Bribe Queueing Model for Bid Advising in Cloud Spot Markets -- Learning and Verification -- DSMC Evaluation Stages: Fostering Robust and Safe Behavior in Deep Reinforcement Learning -- Active and sparse methods in smoothed model checking -- Safe Learning for Near-Optimal Scheduling -- Simulation -- Symbolic Simulation of Railway Timetables under Consideration of Stochastic Dependencies -- Simulation of n-dimensional second-order fluid models with different absorbing, reflecting and mixed barriers -- Performance Evaluation -- Queue Response Times with Server Speed Controlled by Measured Utilizations -- Service Demand Distribution Estimation for Microservices Using Markovian Arrival Processes -- Performance analysis of work stealing strategies in large scale multi-threaded computing -- Abstractions and Aggregations -- Stationary Distribution Approximations of Markovian Population Models using Aggregation -- Reasoning about Proportional Lumpability -- Lumpability for Uncertain Continuous-Time Markov Chains -- Stochastic Models -- Accurate Approximate Diagnosis of (Controllable) Stochastic Systems -- Optimizing reachability probabilities for a restricted class of Stochastic Hybrid Automata via Flowpipe-Construction -- Attack Trees vs. Fault Trees: two sides of the same coin from different currencies. |
| Record Nr. | UNISA-996464396903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Quantitative Evaluation of Systems : 18th International Conference, QEST 2021, Paris, France, August 23–27, 2021, Proceedings / / edited by Alessandro Abate, Andrea Marin
| Quantitative Evaluation of Systems : 18th International Conference, QEST 2021, Paris, France, August 23–27, 2021, Proceedings / / edited by Alessandro Abate, Andrea Marin |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (469 pages) |
| Disciplina | 004.24 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science - Mathematics Mathematical statistics Artificial intelligence Software engineering Algorithms Machine theory Theory of Computation Probability and Statistics in Computer Science Artificial Intelligence Software Engineering Formal Languages and Automata Theory |
| ISBN | 3-030-85172-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Speaker -- Performance Evaluation: Model-Driven or Problem-Driven? -- Probabilistic Model Checking -- A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking -- Tweaking the Odds in Probabilistic Timed Automata -- Quantifying Software Reliability via Model-Counting -- Quantitative Models and Metamodels: Analysis and Validation -- Compositional safe approximation of response time distribution of complex workflows -- Transient Analysis of Hierarchical Semi-Markov Process Models with Tool Support in Stateflow -- Evaluating the Effectiveness of Metamodels in Emulating Quantitative Models -- Queueing Systems -- Network Calculus for Bounding Delays in Feedforward Networks of FIFO Queueing Systems -- SEH: Size Estimate Hedging for Single-Server Queues -- An Approximate Bribe Queueing Model for Bid Advising in Cloud Spot Markets -- Learning and Verification -- DSMC Evaluation Stages: Fostering Robust and Safe Behavior in Deep Reinforcement Learning -- Active and sparse methods in smoothed model checking -- Safe Learning for Near-Optimal Scheduling -- Simulation -- Symbolic Simulation of Railway Timetables under Consideration of Stochastic Dependencies -- Simulation of n-dimensional second-order fluid models with different absorbing, reflecting and mixed barriers -- Performance Evaluation -- Queue Response Times with Server Speed Controlled by Measured Utilizations -- Service Demand Distribution Estimation for Microservices Using Markovian Arrival Processes -- Performance analysis of work stealing strategies in large scale multi-threaded computing -- Abstractions and Aggregations -- Stationary Distribution Approximations of Markovian Population Models using Aggregation -- Reasoning about Proportional Lumpability -- Lumpability for Uncertain Continuous-Time Markov Chains -- Stochastic Models -- Accurate Approximate Diagnosis of (Controllable) Stochastic Systems -- Optimizing reachability probabilities for a restricted class of Stochastic Hybrid Automata via Flowpipe-Construction -- Attack Trees vs. Fault Trees: two sides of the same coin from different currencies. |
| Record Nr. | UNINA-9910495168603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||