default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDennis Guck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[b1]Dennis Guck:
Reliable systems: fault tree analysis via Markov reward automata. University of Twente, Enschede, Netherlands, 2017- [j2]Sebastian Junges
, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga:
Fault trees on a diet: automated reduction by graph rewriting. Formal Aspects Comput. 29(4): 651-703 (2017) - 2016
- [c12]Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Mariëlle Stoelinga:
Uncovering Dynamic Fault Trees. DSN 2016: 299-310 - [c11]Enno Ruijters, Dennis Guck, Martijn van Noort, Mariëlle Stoelinga:
Reliability-Centered Maintenance of the Electrically Insulated Railway Joint via Fault Tree Analysis: A Practical Experience Report. DSN 2016: 662-669 - [c10]Dimitra Giannakopoulou, Dennis Guck, Johann Schumann:
Exploring Model Quality for ACAS X. FM 2016: 274-290 - [c9]Enno Ruijters, Dennis Guck, Peter Drolenga, Margot Peters, Mariëlle Stoelinga:
Maintenance Analysis and Optimization via Statistical Model Checking - Evaluating a Train Pneumatic Compressor. QEST 2016: 331-347 - 2015
- [c8]Dennis Guck, Jip Spel, Mariëlle Stoelinga:
DFTCalc: Reliability Centered Maintenance via Fault Tree Analysis (Tool Paper). ICFEM 2015: 304-311 - [c7]Florian Arnold, Dennis Guck, Rajesh Kumar, Mariëlle Stoelinga:
Sequential and Parallel Attack Tree Modelling. SAFECOMP Workshops 2015: 291-299 - [c6]Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga:
Fault Trees on a Diet - - Automated Reduction by Graph Rewriting -. SETTA 2015: 3-18 - [i2]Rajesh Kumar, Dennis Guck, Mariëlle Stoelinga:
Time Dependent Analysis with Dynamic Counter Measure Trees. CoRR abs/1510.00050 (2015) - 2014
- [j1]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Analysis of Timed and Long-Run Objectives for Markov Automata. Log. Methods Comput. Sci. 10(3) (2014) - [c5]Dennis Guck, Mark Timmer, Hassan Hatefi, Enno Ruijters, Mariëlle Stoelinga:
Modelling and Analysis of Markov Reward Automata. ATVA 2014: 168-184 - 2013
- [c4]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Modelling, Reduction and Analysis of Markov Automata. QEST 2013: 55-71 - [c3]Florian Arnold, Axel Belinfante, Freark I. van der Berg, Dennis Guck, Mariëlle Stoelinga:
DFTCalc: A Tool for Efficient Fault Tree Analysis. SAFECOMP 2013: 293-301 - [i1]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen, Mark Timmer:
Modelling, Reduction and Analysis of Markov Automata (extended version). CoRR abs/1305.7050 (2013) - 2012
- [c2]Dennis Guck, Tingting Han, Joost-Pieter Katoen, Martin R. Neuhäußer:
Quantitative Timed Analysis of Interactive Markov Chains. NASA Formal Methods 2012: 8-23 - [c1]Florian Arnold, Daniel Gebler, Dennis Guck, Hassan Hatefi:
A Tutorial on Interactive Markov Chains. ROCKS 2012: 26-66
Coauthor Index
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.
last updated on 2024-04-24 23:17 CEST 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:
