Marin / Abate | Quantitative Evaluation of Systems | Buch | 978-3-030-85171-2 | sack.de

Buch, Englisch, Band 12846, 469 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 733 g

Reihe: Lecture Notes in Computer Science

Marin / Abate

Quantitative Evaluation of Systems

18th International Conference, QEST 2021, Paris, France, August 23-27, 2021, Proceedings
1. Auflage 2021
ISBN: 978-3-030-85171-2
Verlag: Springer International Publishing

18th International Conference, QEST 2021, Paris, France, August 23-27, 2021, Proceedings

Buch, Englisch, Band 12846, 469 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 733 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-030-85171-2
Verlag: Springer International Publishing


This book constitutes the proceedings of the 18th International Conference on Quantitative Evaluation Systems, QEST 2021, held in Paris, France, in August 2021.

The 21 full papers and 2 short papers presented together with 2 keynote papers were carefully reviewed and selected from 47 submissions. The papers are organized in the following topics: probabilistic model checking; quantitative models and metamodels: analysis and validation; queueing systems; learning and verification; simulation; performance evaluation; abstractions and aggregations; and stochastic models.

Marin / Abate Quantitative Evaluation of Systems jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.