default search action
Mark Timmer
Person information
- affiliation: University of Twente, Enschede, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c14]Ed Brinksma, Mariëlle I. A. Stoelinga
, Mark Timmer:
Testing Divergent Transition Systems. Models, Algorithms, Logics and Tools 2017: 339-366 - 2016
- [j6]Mark Timmer, Joost-Pieter Katoen
Confluence reduction for Markov automata. Theor. Comput. Sci. 655: 193-219 (2016) - 2015
- [j5]Arnd Hartmanns
Sound statistical model checking for MDP using partial order and confluence reduction. Int. J. Softw. Tools Technol. Transf. 17(4): 429-456 (2015) - 2014
- [j4]Dennis Guck, Hassan Hatefi, Holger Hermanns
Analysis of Timed and Long-Run Objectives for Markov Automata. Log. Methods Comput. Sci. 10(3) (2014) - [j3]Mark Timmer:
Abstract of PhD Thesis. Bull. EATCS 112 (2014) - [j2]Henri Hansen
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time. Theor. Comput. Sci. 538: 103-123 (2014) - [c13]Dennis Guck, Mark Timmer, Hassan Hatefi, Enno Ruijters
Modelling and Analysis of Markov Reward Automata. ATVA 2014: 168-184 - 2013
- [b1]Mark Timmer:
Efficient modelling, generation and analysis of Markov automata. University of Twente, Enschede, Netherlands, 2013 - [c12]Mark Timmer
Confluence Reduction for Markov Automata. FORMATS 2013: 243-257 - [c11]Arnd Hartmanns
On-the-Fly Confluence Detection for Statistical Model Checking. NASA Formal Methods 2013: 337-351 - [c10]Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen
Modelling, Reduction and Analysis of Markov Automata. QEST 2013: 55-71 - [c9]Willem Gerrit Johan Stokkink, Mark Timmer
Divergent Quiescent Transition Systems. TAP@STAF 2013: 214-231 - [i2]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
- [j1]Joost-Pieter Katoen
A linear process-algebraic format with data for probabilistic automata. Theor. Comput. Sci. 413(1): 36-57 (2012) - [c8]Mark Timmer
Efficient Modelling and Generation of Markov Automata. CONCUR 2012: 364-379 - [c7]Gerjan Stokkink, Mark Timmer
Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation. MBT 2012: 73-87 - 2011
- [c6]Mark Timmer
SCOOP: A Tool for SymboliC Optimisations of Probabilistic Processes. QEST 2011: 149-150 - [c5]Mark Timmer
Confluence Reduction for Probabilistic Systems. TACAS 2011: 311-325 - [p1]Mark Timmer, Ed Brinksma, Mariëlle Stoelinga
Model-Based Testing. Software and Systems Safety - Specification and Verification 2011: 1-32 - 2010
- [c4]Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga
A Linear Process-Algebraic Format for Probabilistic Systems with Data. ACSD 2010: 213-222 - [i1]Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol:
Confluence Reduction for Probabilistic Systems (extended version). CoRR abs/1011.2314 (2010)
2000 – 2009
- 2009
- [c3]Jaco van de Pol, Mark Timmer
State Space Reduction of Linear Processes Using Control Flow Reconstruction. ATVA 2009: 54-68 - [c2]Mariëlle Stoelinga
Interpreting a Successful Testing Process: Risk and Actual Coverage. TASE 2009: 251-258 - 2006
- [c1]Mark Timmer, Pieter-Tjerk de Boer, Aiko Pras:
How to Identify the Speed Limiting Factor of a TCP Flow. E2EMON 2006: 17-24
Coauthor Index
aka: Mariëlle I. A. Stoelinga
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-05-02 21:01 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: