Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Quantitative Evaluation of Systems - 11th International Conference, QEST 2014, Florence, Italy,

Quantitative Evaluation of Systems

11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014, Proceedings

Norman, Gethin, Sanders, William (Eds.)

2014, XIV, 422 p. 111 illus.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-319-10696-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-319-10695-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This book constitutes the proceedings of the 11th International Conference on Quantitative Evaluation of Systems, QEST 2014, held in Florence, Italy, in September 2014. The 24 full papers and 5 short papers included in this volume were carefully reviewed and selected from 61 submissions. They are organized in topical sections named: Kronecker and product form methods; hybrid systems; mean field/population analysis; models and tools; simulation; queueing, debugging and tools; process algebra and equivalences; automata and Markov process theory; applications, theory and tools; and probabilistic model checking.

Content Level » Research

Keywords » Markov processes - computer networks - formal languages and automata theory - formal methods - hardware validation - model checking - models of computation - performance evaluation - reliability - safety critical systems - simulation - stochastic model checking - theory of computation - theory of probability - timed and hybrid models - verification

Related subjects » Communication Networks - Theoretical Computer Science

Table of contents 

Keynote Presentations.- Quantitative Evaluation of Service Dependability in Shared Execution Environments.- Multi-agent Networked Systems with Adversarial Elements.- Kronecker and Product Form Methods.- A Structured Solution Approach for Markov Regenerative Processes.- Low-Rank Tensor Methods for Communicating Markov Processes.- Hybrid Systems.- A Statistical Approach for Computing Reachability of Non-linear and Stochastic Dynamical Systems.- Formal Synthesis and Validation of Inhomogeneous Thermostatically Controlled Loads.- Finite Abstractions of Stochastic Max-Plus-Linear Systems.- Mean Field/Population Analysis.- Mean Field for Performance Models with Generally-Distributed Timed Transitions.- Mean-Field Approximation and Quasi-Equilibrium Reduction of Markov Population Models.- On Performance of Gossip Communication in a Crowd-Sensing Scenario.- Models and Tools.- Probabilistic Model Checking of DTMC Models of User Activity Patterns.- Performance Comparison of IEEE 802.11 DCF and EDCA for Beaconing in Vehicular Networks.- A New Great SPN GUI for GSPN Editing and CSLTA Model Checking.- The Octave Queueing.- Package.- Simulation.- A Perfect Sampling Algorithm of Random Walks with Forbidden Arcs.- Modelling Replication in No SQL Datastores.- Queueing, Debugging and Tools.- On Queues with General Service Demands and Constant Service Capacity.- Simulation Debugging and Visualization in the Mobius Modeling Framework.- Scalar: A Distributed Scalability Analysis Framework.- Non-intrusive Scalable Memory Access Tracer.- Process Algebra and Equivalences.- Probabilistic Programming Process Algebra.- PALOMA: A Process Algebra for Located Markovian Agents.- On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems.- Automata and Markov Process Theory.- Continuity Properties of Distances for Markov Processes.- Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.- Decidable Problems for Unary PFAs.- Applications, Theory and Tools.- A Scalable Approach to the Assessment of Storm Impact in Distributed Automation Power Grids.- Compositionality Results for Quantitative Information Flow.- CyberSAGE: A Tool for Automatic Security Assessment of Cyber-Physical Systems.- Probabilistic Model Checking.- Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains.- Accelerating Parametric Probabilistic Verification.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Logics and Meanings of Programs.