default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPepijn Crouzen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[b1]Pepijn Crouzen:
Modularity and determinism in compositional Markov models. Saarland University, 2015- 2011
- [c12]Pepijn Crouzen, Ernst Moritz Hahn, Holger Hermanns
, Abhishek Dhama, Oliver E. Theel, Ralf Wimmer, Bettina Braitling, Bernd Becker:
Bounded Fairness for Probabilistic Distributed Algorithms. ACSD 2011: 89-97 - [c11]Pepijn Crouzen, Frédéric Lang:
Smart Reduction. FASE 2011: 111-126 - [c10]Aleksandr Andreychenko, Pepijn Crouzen, Verena Wolf:
On-the-fly Uniformization of Time-Inhomogeneous Infinite Markov Population Models. QAPL 2011: 1 - 2010
- [j2]Hichem Boudali, Pepijn Crouzen, Mariëlle Stoelinga:
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis. IEEE Trans. Dependable Secur. Comput. 7(2): 128-143 (2010) - [c9]Pepijn Crouzen, Holger Hermanns:
Aggregation Ordering for Massively Compositional Models. ACSD 2010: 171-180 - [c8]Ralf Wimmer, Bettina Braitling, Bernd Becker, Ernst Moritz Hahn, Pepijn Crouzen, Holger Hermanns, Abhishek Dhama, Oliver E. Theel:
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems. QEST 2010: 27-36 - [c7]Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio, Ernst Moritz Hahn, Lijun Zhang:
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains. SPIN 2010: 193-211
2000 – 2009
- 2009
- [c6]Abhishek Dhama, Oliver E. Theel, Pepijn Crouzen, Holger Hermanns, Ralf Wimmer, Bernd Becker:
Dependability Engineering of Silent Self-stabilizing Systems. SSS 2009: 238-253 - 2008
- [j1]Pepijn Crouzen, Jaco van de Pol, Arend Rensink:
Applying formal methods to gossiping networks with mCRL and groove. SIGMETRICS Perform. Evaluation Rev. 36(3): 7-16 (2008) - [c5]Pepijn Crouzen, Holger Hermanns, Lijun Zhang:
On the Minimisation of Acyclic Models. CONCUR 2008: 295-309 - [c4]Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haverkort, Matthias Kuntz, Mariëlle Stoelinga:
Architectural dependability evaluation with Arcade. DSN 2008: 512-521 - [c3]Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haverkort, Matthias Kuntz, Mariëlle Stoelinga:
Arcade - A Formal, Extensible, Model-Based Dependability Evaluation Framework. ICECCS 2008: 243-248 - 2007
- [c2]Hichem Boudali, Pepijn Crouzen, Mariëlle Stoelinga:
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains. ATVA 2007: 441-456 - [c1]Hichem Boudali, Pepijn Crouzen, Mariëlle Stoelinga:
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains. DSN 2007: 708-717 - [i1]Lucia Cloth, Pepijn Crouzen, Matthias Fruth, Tingting Han, David N. Jansen, Mark Kattenbelt, Gerard J. M. Smit, Lijun Zhang:
07101 Working Group Report -- Performance Measures Other Than Time. Quantitative Aspects of Embedded Systems 2007
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 22:52 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:
