Joshi / D'Argenio / Siegle | Quantitative Evaluation of Systems | Buch | 978-3-642-40195-4 | sack.de

Buch, Englisch, Band 8054, 406 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 633 g

Reihe: Lecture Notes in Computer Science

Joshi / D'Argenio / Siegle

Quantitative Evaluation of Systems

10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013, Proceedings
2013
ISBN: 978-3-642-40195-4
Verlag: Springer

10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013, Proceedings

Buch, Englisch, Band 8054, 406 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 633 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-642-40195-4
Verlag: Springer


This book constitutes the thoroughly refereed proceedings of the 10th International Conference on Quantitative Evaluation of Systems, QEST 2013, held in Buenos Aires, Argentina, August 27-30, 2013. The 21 revised full papers presented together with 9 tool demonstrations were carefully reviewed and selected from 52 submissions. The papers are organized in topics such as probabilistic automata and Markov automata, population models, model checking and systems, systems, control and games, timed automata and simulation.

Joshi / D'Argenio / Siegle Quantitative Evaluation of Systems jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Computer-Aided Security Proofs.- On the Interplay between Content Popularity and Performance in P2P Systems.- Refinement and Difference for Probabilistic Automata.- High-Level Counterexamples for Probabilistic Automata.- Modelling, Reduction and Analysis of Markov Automata.- Deciding Bisimilarities on Distributions.- Learning and Designing Stochastic Processes from Logical Constraints.- Characterizing Oscillatory and Noisy Periodic Behavior in Markov Population Models.- Model Checking Markov Population Models by Central Limit Approximation.- Fluid Limit for the Machine Repairman Model with Phase-Type Distributions.- Tulip: Model Checking Probabilistic Systems Using Expectation Maximisation Algorithm.- PLASMA-lab: A Flexible, Distributable Statistical Model Checking Library.- STRONG: A Trajectory-BasedVerification Toolbox for Hybrid Systems.- PEPERCORN: Inferring Performance Models from Location Tracking Data.- ADTool: Security Analysis with Attack–Defense Trees.- SAT-Based Analysis and Quantification of Information Flow in Programs.- Prinsys—On a Quest for Probabilistic Loop Invariants.- Revisiting Weak Simulation for Substochastic Markov Chains.- A Performance Analysis of System S, S4, and Esper via Two Level Benchmarking.- Effect of Codeword Placement on the Reliability of Erasure Coded Data Storage Systems.- Fault-Impact Models Based on Delay and Packet Loss for IEEE 802.11g.- VeriSiMPL: Verification via biSimulations of MPL Models.- The BisimDist Library: Efficient Computation of Bisimilarity Distances for Markovian Models.- Möbius Shell: A Command-Line Interface for Möbius.- A CTL Model Checker for Stochastic Automata Networks.- The Steady-State Control Problem for Markov Decision Processes.- Symbolic Control of Stochastic Switched Systems via Finite Abstractions.- Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving.- Stochastic Parity Games on Lossy Channel Systems.- Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes.- Automated Rare Event Simulation for Stochastic Petri Nets.- Topology-Based Mobility Models for Wireless Networks. 



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.