Cantitate/Preț
Produs
Total produse
Vezi coșul
Quantitative Evaluation of Systems: 11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014, Proceedings de Gethin Norman

Quantitative Evaluation of Systems: 11th International Conference, QEST 2014, Florence, Italy, September 8-10, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8657

Editat de Gethin Norman, William Sanders
en Limba Engleză Paperback – 20 aug 2014
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32642 lei

Preț vechi: 40802 lei
-20%

Puncte Express: 490
Preț estimativ în valută:
5771€ • 6880$ • 5005£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319106953
ISBN-10: 3319106953
Pagini: 436
Ilustrații: XIV, 422 p. 111 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.61 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.