My Account Log in

1 option

Quantitative Evaluation of Systems : 11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014, Proceedings / edited by Gethin Norman, William Sanders.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Norman, Gethin, Editor.
Sanders, William, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8657
Theoretical Computer Science and General Issues, 2512-2029 ; 8657
Language:
English
Subjects (All):
Computer science.
Electronic digital computers-Evaluation.
Computer science-Mathematics.
Mathematical statistics.
Computer Science Logic and Foundations of Programming.
System Performance and Evaluation.
Probability and Statistics in Computer Science.
Theory of Computation.
Local Subjects:
Computer Science Logic and Foundations of Programming.
System Performance and Evaluation.
Probability and Statistics in Computer Science.
Theory of Computation.
Physical Description:
1 online resource (XIV, 422 pages) : 111 illustrations
Edition:
1st ed. 2014.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2014.
System Details:
text file PDF
Summary:
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.
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.
Other Format:
Printed edition:
ISBN:
978-3-319-10696-0
9783319106960
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account