Quantitative Evaluation of Systems

Name: Quantitative Evaluation of Systems | 12th International Conference, QEST 2015, Madrid, Spain, September 1-3, 2015, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

12th International Conference, QEST 2015, Madrid, Spain, September 1-3, 2015, Proceedings

Javier Campos Boudewijn R. Haverkort(Herausgeber*in)

Springer (Verlag)

Erschienen am 21. August 2015

XVI, 329 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-22264-6 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Abstracts of Keynote Talks
Reasoning About the Trade-Off Between Security and Performance
Uniting Academic Achievements on Performance Analysis with Industrial Needs
Contents
Keynote Presentation
Uniting Academic Achievements on Performance Analysis with Industrial Needs
1 Introduction
2 Approach
3 Lessons Learned
4 Industrial Applications
4.1 Lithography Systems (ASML)
4.2 Multi-functional High-End Printer (Océ)
4.3 Interventional X-Ray Systems (Philips)
5 Related Work
6 Concluding Remarks
References
Modelling and Applications
Stochastic Modeling for Performance Evaluation of Database Replication Protocols
Abstract
1 Introduction
2 Related Work
3 Stochastic Model of Database Server Operation
3.1 Model of a Database Server
3.2 Concurrency Control
3.3 Measures of Interest
4 DivRep Replication Protocol and SAN-Based Implementation
4.1 The Chosen Database Replication Protocol - DivRep
4.2 SAN-Based Model of Client, Servers and DivRep
5 Statistical Analysis and Validation of Modeling Assumptions
5.1 Test Harness for Real System Experimentation
5.2 Model Assumptions Validation
5.3 Correlation of SQL Statements Durations
5.4 Client-Server System Model Validation
6 Results
7 Discussion
8 Conclusions
References
A Continuous-Time Model-Based Approach to Activity Recognition for Ambient Assisted Living
1 Introduction
2 Problem Formulation
2.1 Description of the Data Set Under Consideration
2.2 Statistical Abstraction
3 Classification Technique
3.1 Model Syntax and Semantics
3.2 Model Structure and Enhancement
3.3 Online Diagnosis and Prediction
4 Computational Experience
4.1 Experimental Setup
4.2 Results
5 Discussion
References
Power Trading Coordination in Smart Grids Using Dynamic Learning and Coalitional Game Theory
1 Introduction
2 Transmission Line Model
3 System Model and Problem Formulation
3.1 System Model
3.2 Problem Formulation
4 Best Response Algorithm
4.1 Coalition Formation Dynamic Learning Process
4.2 Power Loss Minimization Dynamic Learning Process
5 Numerical Results
6 Conclusion
References
PCA-Based Method for Detecting Integrity Attacks on Advanced Metering Infrastructure
1 Introduction
2 Description of the Dataset
3 Data-Driven Detection Strategies
3.1 Assumptions and Notations Used in Detection
3.2 Use of Averages to Detect Anomalies
3.3 Detecting Anomalies with Principal Component Analysis
4 Evaluation of Detection Methods
4.1 Runtime Memory Cost of Implementing the Detectors
4.2 Evaluation Methodology
4.3 Attack Injection Methods
4.4 Results
5 Conclusion
References
Tools
U-Check: Model Checking and Parameter Synthesis Under Uncertainty
1 Introduction and Motivation
2 Background Material
2.1 Population CTMC
2.2 Property Specification
2.3 Statistical Methodologies
3 Software Architecture
3.1 Gaussian Processes Framework
3.2 GP Optimisation Framework
3.3 Model Checking Framework
3.4 Smoothed Model Checking
3.5 Learning from Formulae
3.6 U-Check CLI
4 Configuration Options
4.1 Experiment Configuration
4.2 Simulation Options
4.3 GP Options
5 Case Study
5.1 Smoothed Model Checking
5.2 Robust Parameter Synthesis
5.3 Inference from Qualitative Data
6 Conclusions
References
mapfit: An R-Based Tool for PH/MAP Parameter Estimation
1 Introduction
2 Related Work
3 PH Fitting
3.1 Overview
3.2 Data for PH Fitting
3.3 Models and Methods
4 MAP Fitting
4.1 Overview
4.2 Data for MAP Fitting
4.3 Models and Methods
5 Example
6 Conclusion and Future Work
References
A Compression App for Continuous Probability Distributions
1 Quantitative Verification at Your Fingertips
2 Stochastic Time-Dependent Behavior Modelling
3 Acyclic Phase-Type Compression
4 The App and Its Functionality
5 Compression Acceleration Heuristics
6 Discussion
References
Petri Nets, Process Algebra and Fault Trees
Computing Structural Properties of Symmetric Nets
1 Introduction
2 Basic Definitions and Notation
2.1 The Symmetric Nets Formalism
2.2 The Language to Express Structural Properties
3 Structural Properties Computation
3.1 Structural Mutual Exclusion
3.2 Symmetric SC Transitive Closure and Extended Conflict Sets
4 Conclusions and Future Work
References
Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis
1 Introduction
2 Preliminaries
3 Unconstrained Optimization
3.1 Reduction to DTMDP M with Uncountable Space of Actions
3.2 Discretization of the Uncountable MDP M
4 Bounded Optimization Under Partial Observation
4.1 Approximation Algorithm
4.2 Complexity of the Threshold Problem
5 Conclusions
References
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses
1 Introduction
2 Preliminaries
3 Stochastic Automata
4 Quasi-Reversible Automata
5 Lumpable Bisimulations and Exact Equivalences
6 Conclusion
References
A Numerical Analysis of Dynamic Fault Trees Based on Stochastic Bounds
1 Introduction
2 Stochastic Bounds and Calculus on Distributions
2.1 Stochastic Bounds
2.2 Algorithms to Construct Bounding Distributions
3 Dynamic Fault Trees Without Replicated Events
3.1 Functionality of Gates
3.2 Monotonicity of Gates
3.3 DFT Evaluation and Bounding Algorithm
4 Replicated Events and Conditional Probabilities
4.1 Evaluation of PAND Gates
4.2 DFT with Replication but Without PAND Gates
4.3 DFT with Replicated Events and PAND Gates
5 Open Questions and Conclusions
References
Applications
Quantitative Placement of Services in Hierarchical Clouds
1 Introduction
2 The General Placement Problem
2.1 Problem Description
2.2 Solution Approach: Biased Sampling
3 Constrained Hierarchical Group Placement
3.1 Physical Tree
3.2 Logical Tree
3.3 Biasing the Placement
4 Constrained Placement : Upper Bounds
4.1 Example: Placement with Upper Bounds
4.2 Special Case: Group Anti-collocation
5 Constrained Placement: Lower and Upper Bounds
5.1 Special Case: Group Collocation
6 Constrained Placement: Quantitative Placement
7 Experimental Results
7.1 Performance Improvement
7.2 Performance Scalability
8 Conclusion
References
Characterizing Data Dependence Constraints for Dynamic Reliability Using N-Queens Attack Domains
1 Introduction
2 Characterizing File System Dependence
2.1 Dependence Due to RAID
2.2 Dependence Due to Deduplication
3 N-Queens with Dynamic Domains of Attack
4 Solving Virtual Disk Allocation with N-Queens
4.1 Translation into Z3
5 Experimental Results and Validation
6 Conclusions
6.1 Future Work
References
Quantitative Analysis of Consistency in NoSQL Key-Value Stores
1 Introduction
2 Preliminaries
2.1 Cassandra Overview
2.2 Rewriting Logic and Maude
2.3 Statistical Model Checking and PVeStA
3 Replicated Data Consistency
4 Probabilistic Modeling of Cassandra Designs
4.1 Formalizing Probabilistic Communication in Cassandra
4.2 Alternative Strategy Design
5 Quantitative Analysis of Consistency in Cassandra
5.1 Statistical Model Checking Analysis
5.2 Implementation-Based Evaluation of Consistency
6 Related Work and Concluding Remarks
References
Impact of Policy Design on Workflow Resiliency Computation Time
1 Introduction
2 Related Work
3 Workflow
3.1 Workflow Definition
3.2 Workflow Satisfiability Problem
3.3 Workflow Resiliency
4 Computing Workflow Resiliency at Runtime
5 Empirical Assessment of Policy Changes
5.1 Assessment Methodology
5.2 Results
6 Reducing Computation Time
6.1 Adding Separations of Duty
6.2 Removing User Permissions
6.3 Calculating Dummy Constraints
7 Conclusion
A Probabilities for User Availability
References
Queueing Systems and Hybrid Systems
Perfect Sampling for Multiclass Closed Queueing Networks
1 Introduction
2 Model
2.1 Description
2.2 State Space
2.3 Service Discipline and Transitions
2.4 Markov Chain and Perfect Sampling
3 Diagram Representation
3.1 Definition
3.2 Transition Algorithm
3.3 Perfect Sampling with Diagrams
4 Numerical Experiments
4.1 Network of Example 1
4.2 Bidirectional Ring Network
4.3 Comparisons of the Number of States |S| and the Size of the Diagram Representation |g(S)|
5 Conclusion
References
Power and Effectiveness in Queueing Systems
1 Introduction
2 Power
3 The Case of an Open Product Form Queueing Network
4 Problems with the Power Metric
5 Effectiveness
6 Effectiveness in a Jackson Network
7 Conclusion
References
A Solving Procedure for Stochastic Satisfiability Modulo Theories with Continuous Domain
1 Introduction
2 Preliminaries
2.1 Interval Arithmetic and Constraint Solving
2.2 Probability Basis
3 Stochastic Satisfiability Modulo Theories with Continuous Domain
4 CSSMT Solving
5 Case Study
5.1 SSMT Formalization
5.2 Experiment Results
6 Conclusion and Future Work
References
Bayesian Statistical Analysis for Performance Evaluation in Real-Time Control Systems
1 Introduction
2 Case Study
2.1 Test Systems
3 Modelling and Specification
4 Definition of Performance
5 Statistical Analysis
5.1 Bayesian Estimation Algorithm
5.2 Bayesian Hypothesis Testing
5.3 Algorithm Analysis
6 Application
7 Related Work
8 Conclusions
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken