default search action
QEST 2008: Saint-Malo, France
- Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 14-17 September 2008, Saint-Malo, France. IEEE Computer Society 2008, ISBN 978-0-7695-3360-5
Invited Talks
- Michael L. Littman:
Autonomous Model Learning for Reinforcement Learning. 3
Networking
- Yimeng Yang, Boudewijn R. Haverkort
, Geert J. Heijenk
A Control-Theoretic Modeling Approach for Service Differentiation in Multi-hop Ad-hoc Networks. 7-16 - Issam Mabrouki, Gwillerm Froc, Xavier Lagrange:
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks. 17-26 - Sara Alouf
Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism. 27-36 - Athanassios Boulis, Ansgar Fehnker
CaVi -- Simulation and Model Checking for Wireless Sensor Networks. 37-38 - Bart D. Theelen:
Performance Model Generation for MPSoC Design-Space Exploration. 39-40 - Ruth Lamprecht, Peter Kemper:
Möbius Trace Analysis with Traviando. 41-42
Quantitative Verification
- Frank Ciesinski, Christel Baier, Marcus Größer, Joachim Klein
Reduction Techniques for Model Checking Markov Decision Processes. 45-54 - Nathalie Bertrand
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. 55-64 - Ralf Wimmer, Salem Derisavi, Holger Hermanns
Symbolic Partition Refinement with Dynamic Balancing of Time and Space. 65-74 - Alexandre Borghi, Thomas Hérault
Cell Assisted APMC. 75-76 - Jiri Barnat, Lubos Brim, Ivana Cerná
ProbDiVinE-MC: Multi-core LTL Model Checker for Probabilistic Systems. 77-78 - Christopher Power, Alice Miller
Prism2Promela. 79-80
Tools
- Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni:
KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes. 83-92 - Sebastian Gaisbauer, Johannes Kirschnick, Nigel Edwards, Jerry Rolia:
VATS: Virtualized-Aware Automated Test Service. 93-102 - Pritam Roy, David Parker
Symbolic Magnifying Lens Abstraction in Markov Decision Processes. 103-112 - Martin Riedl, Johann Schuster, Markus Siegle
Recent Extensions to the Stochastic Process Algebra Tool CASPA. 113-114 - Giacomo Bucci, Laura Carnevali, Enrico Vicario
A Tool Supporting Evaluation of Non-markovian Fault Trees. 115-116 - Lucia Cloth, Boudewijn R. Haverkort
The Performability Tool P'ility. 117-118
Invited Talks
- Albert Benveniste:
Composing Web Services in an Open World: QoS Issues. 121
Performance Analysis I
- András Horváth, Gábor Horváth
A Joint Moments Based Analysis of Networks of MAP/MAP/1 Queues. 125-134 - Peter Buchholz
Product Form Approximations for Communicating Markov Processes. 135-144
Performance Analysis II
- Jean-Michel Fourneau:
Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution. 147-156 - Paolo Ballarini
Memory Efficient Calculation of Path Probabilities in Large Structured Markov Chains. 157-166
Counter-Examples
- Harald Fecher, Michael Huth, Nir Piterman
Hintikka Games for PCTL on Labeled Markov Chains. 169-178 - Berteun Damman, Tingting Han, Joost-Pieter Katoen
Regular Expressions for PCTL Counterexamples. 179-188 - Husain Aljazzar, Stefan Leue:
Debugging of Dependability Models Using Interactive Visualization of Counterexamples. 189-198
Invited Talks
- Peter W. Glynn:
Linear Programming, Lyapunov Functions, and Performance Analysis. 201
High-Level Models
- Mirco Tribastone
Automatic Translation of UML Sequence Diagrams into PEPA Models. 205-214 - Andrea Bobbio
Analysis of Large Scale Interacting Systems by Mean Field Method. 215-224 - Jorge Júlvez:
Polynomial Throughput Bounds for Equal Conflict Petri Nets with Multi-guarded Transitions. 225-234 - Souheib Baarir, Marco Beccuti
New Solvers for Asymmetric Systems in GreatSPN. 235-236 - Darren K. Brien, Nicholas J. Dingle, William J. Knottenbelt, Harini Kulatunga, Tamas Suto:
A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation. 237-238 - Marc Melià, Catalina M. Lladó, Ramón Puigjaner, Connie U. Smith:
An Experimental Framework for PIPE2. 239-240
Probabilistic and Timed Systems
- Kousha Etessami, Dominik Wojtczak
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. 243-253 - Najla Chamseddine, Marie Duflot
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. 254-263 - Josée Desharnais
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. 264-273 - Deepak D'Souza, Madhu Gopinathan, S. Ramesh, Prahladavaradan Sampath:
Conflict-Tolerant Real-Time Features. 274-283
Applications
- Walter Binder
Cross-Profiling for Embedded Java Processors. 287-296 - Xi Zhang, Alma Riska, Erik Riedel:
Characterization of the E-commerce Storage Subsystem Workload. 297-306 - Elizabeth Van Ruitenbeek, William H. Sanders:
Modeling Peer-to-Peer Botnets. 307-316
Tutorial
- Jean-Marc Vincent:
Perfect Generation, Monotonicity and Finite Queueing Networks. 319 - Mérouane Debbah:
Randomness in Wireless Networks: How to Deal with It. 320 - Enrico Vicario:
Correctness Verification and Quantitative Evaluation of Timed Systems Based on Stochastic State Classes. 321 - James Worrell:
Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains. 322
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: