Остановите войну!
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 42 matches
- 2010
- Erika Ábrahám, Nils Jansen, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker:
DTMC Model Checking by SCC Reduction. QEST 2010: 37-46 - Elvio Gilberto Amparore, Susanna Donatelli:
DSPN-Tool: A New DSPN and GSPN Solver for GreatSPN. QEST 2010: 79-80 - Elvio Gilberto Amparore, Susanna Donatelli:
MC4CSLTA: An Efficient Model Checking Tool for CSLTA. QEST 2010: 153-154 - Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova:
Information Hiding in Probabilistic Concurrent Systems. QEST 2010: 17-26 - Junaid Babar, Andrew S. Miner:
Meddly: Multi-terminal and Edge-Valued Decision Diagram LibrarY. QEST 2010: 195-196 - Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan J. Fokkink, Boudewijn R. Haverkort:
Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST 2010: 241-250 - Falko Bause, Peter Buchholz, Jan Kriege:
ProFiDo - The Processes Fitting Toolkit Dortmund. QEST 2010: 87-96 - Falko Bause, Gábor Horváth:
Fitting Markovian Arrival Processes by Incorporating Correlation into Phase Type Renewal Processes. QEST 2010: 97-106 - Béatrice Bérard, John Mullins, Mathieu Sassolas:
Quantifying Opacity. QEST 2010: 263-272 - Jasper Berendsen, David N. Jansen, Frits W. Vaandrager:
Fortuna: Model Checking Priced Probabilistic Timed Automata. QEST 2010: 273-281 - Levente Bodrog, Peter Buchholz, Jan Kriege, Miklós Telek:
Canonical Form Based MAP(2) Fitting. QEST 2010: 107-116 - Luca Bortolussi, Vashti Galpin, Jane Hillston, Mirco Tribastone:
Hybrid Semantics for PEPA. QEST 2010: 181-190 - Ana Busic, Jean-Michel Fourneau:
A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC. QEST 2010: 81-82 - Ana Busic, Bruno Gaujal, Gaël Gorgo, Jean-Marc Vincent:
PSI2: Envelope Perfect Sampling of Non Monotone Systems. QEST 2010: 83-84 - Benoît Caillaud, Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski:
Compositional Design Methodology with Constraint Markov Chains. QEST 2010: 123-132 - Luca Cardelli, Radu Mardare:
The Measurable Space of Stochastic Processes. QEST 2010: 171-180 - Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf:
SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks. QEST 2010: 193-194 - Derek Doran, Swapna S. Gokhale:
Searching for Heavy Tails in Web Robot Traffic. QEST 2010: 282-291 - Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Kumar, Dean Glazeski:
On the Theory of Stochastic Processors. QEST 2010: 292-301 - Lu Feng, Marta Z. Kwiatkowska, David Parker:
Compositional Verification of Probabilistic Systems Using Learning. QEST 2010: 133-142 - Jens Happe, Henning Groenda, Michael Hauck, Ralf H. Reussner:
A Prediction Model for Software Performance in Symmetric Multiprocessing Environments. QEST 2010: 59-68 - Joseph L. Hellerstein:
The Role of Quantitative Models in Building Scalable Cloud Infrastructures. QEST 2010: 3 - András Horváth, Lorenzo Ridi, Enrico Vicario:
Transient Analysis of Generalised Semi-Markov Processes Using Transient Stochastic State Classes. QEST 2010: 231-240 - Benny Van Houdt:
A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue. QEST 2010: 49-58 - Michael Huth, Nir Piterman, Daniel Wagner:
p-Automata: New Foundations for Discrete-Time Probabilistic Verification. QEST 2010: 161-170 - Vijay Anand Korthikanti, Mahesh Viswanathan, Gul Agha, YoungMin Kwon:
Reasoning about MDPs as Transformers of Probability Distributions. QEST 2010: 199-208 - Jayanand Asok Kumar, Shobha Vasudevan:
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs. QEST 2010: 143-152 - Lawrence Leemis:
Reliability Models. QEST 2010: 308 - Adetokunbo Makanju, Nur Zincir-Heywood, Evangelos E. Milios:
An Evaluation of Entropy Based Approaches to Alert Detection in High Performance Cluster Logs. QEST 2010: 69-78 - Andrea Marin, Maria Grazia Vigliotti:
From Systems to Components: Constructive Methods for Product-Form Solutions. QEST 2010: 305
skipping 12 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-05-23 10:14 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