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 VLDB 2026 / reviewers in the wild / expert

Thomas Hune

dblp:35/366 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2001
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 2 first-authorTheory of computation · 4 · 1 first-author

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
Automated reasoning and model checking · 49% Automata and formal languages · 36% Distributed computing theory · 16%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › timed automata
priced timed automata		 0.012001
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001
Automated reasoning and model checking
reachability		 0.012001
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001
Automata and formal languages
timed automata		 0.012001
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001
Distributed computing theory
distributed verification		 0.012000
Distributing Timed Model Checking - How the Search Order Matters · CAV 2000
Automated reasoning and model checking
model checking		 0.012000
Distributing Timed Model Checking - How the Search Order Matters · CAV 2000
Automated reasoning and model checking › model checking
real-time model checking		 0.012000
Distributing Timed Model Checking - How the Search Order Matters · CAV 2000

Methods — techniques the papers use, named apart from their topics

priced timed automata · 0.0state-space search · 0.0
YearPublicationVenuePosition
2001 As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn
 CAV5
2001 Efficient Guiding Towards Cost-Optimality in UPPAAL
Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn
 TACAS3
2001 Linear Parametric Model Checking of Timed Automata
Thomas Hune, Judi Romijn, Mariëlle Stoelinga, Frits W. Vaandrager
 TACAS1
2000 Distributing Timed Model Checking - How the Search Order Matters
Gerd Behrmann, Thomas Hune, Frits W. Vaandrager
 CAV2
2000 A Case Study on Using Automata in Control Synthesis
Thomas Hune, Anders Sandholm 0001
 FASE1
1999 Bisimulation and Open Maps for Timed Transition Systems
abstract
Formal models for real-time systems have been studied intensively over the past decade. Much of the theory of untimed systems have been lifted to real-time settings. One example is the notion of bisimulation applied to timed transition systems, which
Mogens Nielsen, Thomas Hune
 Fundam. Informaticae2
1998 Timed Bisimulation and Open Maps
Thomas Hune, Mogens Nielsen
 MFCS1