Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 2008
- Husain Aljazzar, Stefan Leue:
Debugging of Dependability Models Using Interactive Visualization of Counterexamples. QEST 2008: 189-198 - Sara Alouf, Eitan Altman, Amar Prakash Azad:
Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism. QEST 2008: 27-36 - Souheib Baarir, Marco Beccuti, Giuliana Franceschinis:
New Solvers for Asymmetric Systems in GreatSPN. QEST 2008: 235-236 - Paolo Ballarini, András Horváth:
Memory Efficient Calculation of Path Probabilities in Large Structured Markov Chains. QEST 2008: 157-166 - Jiri Barnat, Lubos Brim, Ivana Cerná, Milan Ceska, Jana Tumova:
ProbDiVinE-MC: Multi-core LTL Model Checker for Probabilistic Systems. QEST 2008: 77-78 - Albert Benveniste:
Composing Web Services in an Open World: QoS Issues. QEST 2008: 121 - Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64 - Walter Binder, Martin Schoeberl, Philippe Moret, Alex Villazón:
Cross-Profiling for Embedded Java Processors. QEST 2008: 287-296 - Andrea Bobbio, Marco Gribaudo, Miklós Telek:
Analysis of Large Scale Interacting Systems by Mean Field Method. QEST 2008: 215-224 - Alexandre Borghi, Thomas Hérault, Richard Lassaigne, Sylvain Peyronnet:
Cell Assisted APMC. QEST 2008: 75-76 - Athanassios Boulis, Ansgar Fehnker, Matthias Fruth, Annabelle McIver:
CaVi -- Simulation and Model Checking for Wireless Sensor Networks. QEST 2008: 37-38 - Darren K. Brien, Nicholas J. Dingle, William J. Knottenbelt, Harini Kulatunga, Tamas Suto:
A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation. QEST 2008: 237-238 - Giacomo Bucci, Laura Carnevali, Enrico Vicario:
A Tool Supporting Evaluation of Non-markovian Fault Trees. QEST 2008: 115-116 - Peter Buchholz:
Product Form Approximations for Communicating Markov Processes. QEST 2008: 135-144 - Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni:
KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes. QEST 2008: 83-92 - Najla Chamseddine, Marie Duflot, Laurent Fribourg, Claudine Picaronny, Jeremy Sproston:
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. QEST 2008: 254-263 - Frank Ciesinski, Christel Baier, Marcus Größer, Joachim Klein:
Reduction Techniques for Model Checking Markov Decision Processes. QEST 2008: 45-54 - Lucia Cloth, Boudewijn R. Haverkort:
The Performability Tool P'ility. QEST 2008: 117-118 - Deepak D'Souza, Madhu Gopinathan, S. Ramesh, Prahladavaradan Sampath:
Conflict-Tolerant Real-Time Features. QEST 2008: 274-283 - Berteun Damman, Tingting Han, Joost-Pieter Katoen:
Regular Expressions for PCTL Counterexamples. QEST 2008: 179-188 - Mérouane Debbah:
Randomness in Wireless Networks: How to Deal with It. QEST 2008: 320 - Josée Desharnais, François Laviolette, Mathieu Tracol:
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. QEST 2008: 264-273 - Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. QEST 2008: 243-253 - Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner:
Hintikka Games for PCTL on Labeled Markov Chains. QEST 2008: 169-178 - Jean-Michel Fourneau:
Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution. QEST 2008: 147-156 - Sebastian Gaisbauer, Johannes Kirschnick, Nigel Edwards, Jerry Rolia:
VATS: Virtualized-Aware Automated Test Service. QEST 2008: 93-102 - Peter W. Glynn:
Linear Programming, Lyapunov Functions, and Performance Analysis. QEST 2008: 201 - András Horváth, Gábor Horváth, Miklós Telek:
A Joint Moments Based Analysis of Networks of MAP/MAP/1 Queues. QEST 2008: 125-134 - Jorge Júlvez:
Polynomial Throughput Bounds for Equal Conflict Petri Nets with Multi-guarded Transitions. QEST 2008: 225-234 - Ruth Lamprecht, Peter Kemper:
Möbius Trace Analysis with Traviando. QEST 2008: 41-42
skipping 16 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-02 19:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint