default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohann Schuster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j5]Christian Eisentraut, Holger Hermanns
, Johann Schuster, Andrea Turrini, Lijun Zhang:
The quest for minimal quotients for probabilistic and Markov automata. Inf. Comput. 262: 162-186 (2018)- 2014
- [j4]Ludwig Griebl, Johann Schuster:
Some notes on the abstraction operation for multi-terminal binary decision diagrams. Formal Methods Syst. Des. 44(1): 91-99 (2014) - [j3]Johann Schuster, Markus Siegle:
Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states. Inf. Comput. 237: 151-173 (2014) - [j2]Nils Jansen, Ralf Wimmer, Erika Ábrahám, Barna Zajzon, Joost-Pieter Katoen, Bernd Becker, Johann Schuster:
Symbolic counterexample generation for large discrete-time Markov chains. Sci. Comput. Program. 91: 90-114 (2014) - 2013
- [c10]Christian Eisentraut, Holger Hermanns, Johann Schuster, Andrea Turrini, Lijun Zhang:
The Quest for Minimal Quotients for Probabilistic Automata. TACAS 2013: 16-31 - [c9]Johann Schuster, Markus Siegle:
Lattice structures for bisimilar Probabilistic Automata. INFINITY 2013: 1-15 - [i2]Ludwig Griebl, Johann Schuster:
Some notes on the abstraction operation for Multi-Terminal Binary Decision Diagrams. CoRR abs/1303.6186 (2013) - 2012
- [b1]Johann Schuster:
Towards faster numerical solution of Continuous Time Markov Chains stored by symbolic data structures. Bundeswehr University Munich, Verlag Dr. Hut 2012 - [c8]Johann Schuster, Markus Siegle:
Scale-Freeness of SPA Models with Weighted Immediate Actions. EPEW/UKPEW 2012: 48-62 - [c7]Nils Jansen, Erika Ábrahám, Barna Zajzon, Ralf Wimmer, Johann Schuster, Joost-Pieter Katoen, Bernd Becker:
Symbolic Counterexample Generation for Discrete-Time Markov Chains. FACS 2012: 134-151 - [c6]Alexander Gouberman, Martin Riedl, Johann Schuster, Markus Siegle:
A Modelling and Analysis Environment for LARES. MMB/DFT 2012: 244-248 - [i1]Johann Schuster, Markus Siegle:
Markov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States. CoRR abs/1205.6192 (2012) - 2010
- [c5]Michael Günther, Johann Schuster, Markus Siegle:
Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA. DYADEM-FTS@EDCC 2010: 13-18 - [c4]Johann Schuster, Markus Siegle:
Dependability modelling with the stochastic process algebra tool CASPA. DYADEM-FTS@EDCC 2010: 35-36
2000 – 2009
- 2009
- [c3]Jens Bachmann, Martin Riedl, Johann Schuster, Markus Siegle:
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA. SOFSEM 2009: 485-496 - 2008
- [j1]Thomas Krieger, Martin Riedl, Johann Schuster, Markus Siegle:
A view-probability-matrix approach to the modelling of gossiping protocols. SIGMETRICS Perform. Evaluation Rev. 36(3): 23-30 (2008) - [c2]Johann Schuster, Markus Siegle:
A Symbolic Multilevel Method with Sparse Submatrix Representation for Memory-Speed-Tradeoff. MMB 2008: 191-206 - [c1]Martin Riedl, Johann Schuster, Markus Siegle:
Recent Extensions to the Stochastic Process Algebra Tool CASPA. QEST 2008: 113-114
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-05-08 21:45 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:
