Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Johann Schuster

dblp:36/6025 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 76% Logic in computer science · 24%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
probabilistic automata		 0.312018
The quest for minimal quotients for probabilistic and Markov automata · Inf. Comput. 2018
Automata and formal languages › probabilistic automata
markov automata		 0.322018
Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states · Inf. Comput. 2014
The quest for minimal quotients for probabilistic and Markov automata · Inf. Comput. 2018
Logic in computer science › bisimulation
weak bisimulation		 0.212014
Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states · Inf. Comput. 2014
YearPublicationVenuePosition
2018 The quest for minimal quotients for probabilistic and Markov automata
Christian Eisentraut, Holger Hermanns, Johann Schuster, Andrea Turrini, Lijun Zhang 0001
 Inf. Comput.3
2014 Some notes on the abstraction operation for multi-terminal binary decision diagrams
Ludwig Griebl, Johann Schuster
 Formal Methods Syst. Des.2
2014 Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states
Johann Schuster, Markus Siegle
 Inf. Comput.1
2014 Symbolic counterexample generation for large discrete-time Markov chains
Nils Jansen 0001, Ralf Wimmer 0001, Erika Ábrahám, Barna Zajzon, Joost-Pieter Katoen, Bernd Becker 0001, Johann Schuster
 Sci. Comput. Program.7
2013 The Quest for Minimal Quotients for Probabilistic Automata
Christian Eisentraut, Holger Hermanns, Johann Schuster, Andrea Turrini, Lijun Zhang 0001
 TACAS3
2009 An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
Jens Bachmann, Martin Riedl 0001, Johann Schuster, Markus Siegle
 SOFSEM3