Demo Data from VLDB 2026 / reviewers in the wild / expert
Gerd Behrmann
dblp:39/5834
· DBLP profile ↗
19ranked-venue papers
12as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 16 · 11 first-authorTheory of computation · 7 · 5 first-authorApplied, 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
5 papers |
Automated reasoning and model checking · 45% Automata and formal languages · 44% Distributed computing theory · 6% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
timed automata |
0.1 | 2 | 2007 | UPPAAL-Tiga: Time for Playing Games! · CAV 2007 As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Automated reasoning and model checking
model checking |
0.1 | 3 | 2007 | To Store or Not to Store · CAV 2003 Distributing Timed Model Checking - How the Search Order Matters · CAV 2000 UPPAAL-Tiga: Time for Playing Games! · CAV 2007 |
Automata and formal languages › timed automata
timed games |
0.1 | 1 | 2007 | UPPAAL-Tiga: Time for Playing Games! · CAV 2007 |
Automated reasoning and model checking › model checking
state space reduction |
0.0 | 1 | 2003 | To Store or Not to Store · CAV 2003 |
Automata and formal languages › timed automata
priced timed automata |
0.0 | 1 | 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Automated reasoning and model checking
reachability |
0.0 | 1 | 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Distributed computing theory
distributed verification |
0.0 | 1 | 2000 | Distributing Timed Model Checking - How the Search Order Matters · CAV 2000 |
Automated reasoning and model checking › model checking
real-time model checking |
0.0 | 1 | 2000 | Distributing Timed Model Checking - How the Search Order Matters · CAV 2000 |
Algorithms and data structures
decision diagrams |
0.0 | 1 | 1999 | Efficient Timed Reachability Analysis Using Clock Difference Diagrams · CAV 1999 |
Methods — techniques the papers use, named apart from their topics
priced timed automata · 0.0state-space search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Storage for Advanced Scientific Use-Cases and BeyondabstractThe dCache project provides open-source storage software deployed internationally to satisfy ever more demanding scientific storage requirements. Its multifaceted approach provides an integrated way of supporting different use-cases with the same storage, from high throughput data ingest, through wide access and easy integration with existing systems. In this paper, we describe some of the recent features that facilitate the use of storage to maximise the gain from stored data, including quality-of-service management, heterogeneous systems - both through integrated tertiary storage support and geographical locality - the parallel NFS (pNFS) extension, and innovative delegated authorisation schemes. A. Paul Millar, Olufemi Adeyemi, Gerd Behrmann, Patrick Fuhrmann, Vincent Garonne, Dmitry Litvintsev, Tigran Mkrtchyan, Albert Rossi, Marina Sahakyan, Jürgen Starek |
PDP | 3 |
| 2011 | Building and Operating a Distributed Regional Centre for LHC Computing and Data StorageabstractThe paper describes the overall design and implementation of the geographically distributed computing and data storage centre as built by the Nordic Data Grid Facility (NDGF) with the driving goal to serve the needs of the Large Hadron Collider research at CERN. In striving to federate heterogeneous resources in different administrative domains, NDGF chose to create an infrastructure using software services offered by different providers: ARC for computing, dCache for storage, SGAS for usage accounting, and elements of gLite for interoperability with the worldwide LHC Computing Grid. Oxana Smirnova, Gerd Behrmann, Michael Grønager, Daniel Johansson, Josva Kleist, Aleksandr Konstantinov, Balázs Kónya, Henrik Thostrup Jensen |
eScience | 2 |
| 2011 | Developing UPPAAL over 15 yearsabstractAbstract UPPAAL is a tool suitable for model checking real‐time systems described as networks of timed automata communicating by channel synchronizations and extended with integer variables. Its first version was released in 1995 and its development is still very active. It now features an advanced modeling language, a user‐friendly graphical interface, and a performant model checker engine. In addition, several flavors of the tool have matured in recent years. In this paper, we present how we managed to maintain the tool during 15 years, its current architecture with its challenges, and we give the future directions of the tool. Copyright © 2011 John Wiley & Sons, Ltd. Gerd Behrmann, Alexandre David, Kim G. Larsen, Paul Pettersson, Wang Yi 0001 |
Softw. Pract. Exp. | 1 |
| 2007 | UPPAAL-Tiga: Time for Playing Games!
Gerd Behrmann, Agnès Cougnard, Alexandre David, Emmanuel Fleury, Kim G. Larsen, Didier Lime |
CAV | 1 |
| 2007 | Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking
Sebastian Kupferschmid, Klaus Dräger, Jörg Hoffmann 0001, Bernd Finkbeiner, Henning Dierks, Andreas Podelski, Gerd Behrmann |
TACAS | 7 |
| 2007 | Complexity in Simplicity: Flexible Agent-Based State Space Exploration
Jacob Illum Rasmussen, Gerd Behrmann, Kim G. Larsen |
TACAS | 2 |
| 2006 | Lower and upper bounds in zone-based abstractions of timed automata
Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelánek |
Int. J. Softw. Tools Technol. Transf. | 1 |
| 2005 | Distributed reachability analysis in timed automata
Gerd Behrmann |
Int. J. Softw. Tools Technol. Transf. | 1 |
| 2004 | Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelánek |
TACAS | 1 |
| 2003 | To Store or Not to Store
Gerd Behrmann, Kim G. Larsen, Radek Pelánek |
CAV | 1 |
| 2003 | Static Guard Analysis in Timed Automata Verification
Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim G. Larsen |
TACAS | 1 |
| 2002 | Verification of Hierarchical State/Event Systems using Reusability and Compositionality
Gerd Behrmann, Kim G. Larsen, Henrik Reif Andersen, Henrik Hulgaard, Jørn Lind-Nielsen |
Formal Methods Syst. Des. | 1 |
| 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 |
CAV | 2 |
| 2001 | Efficient Guiding Towards Cost-Optimality in UPPAAL
Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim G. Larsen, Paul Pettersson, Judi Romijn |
TACAS | 1 |
| 2001 | Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Jørn Lind-Nielsen, Henrik Reif Andersen, Henrik Hulgaard, Gerd Behrmann, Kåre J. Kristoffersen, Kim G. Larsen |
Formal Methods Syst. Des. | 4 |
| 2000 | Distributing Timed Model Checking - How the Search Order Matters
Gerd Behrmann, Thomas Hune, Frits W. Vaandrager |
CAV | 1 |
| 1999 | Efficient Timed Reachability Analysis Using Clock Difference Diagrams
Gerd Behrmann, Kim G. Larsen, Justin Pearson, Carsten Weise, Wang Yi 0001 |
CAV | 1 |
| 1999 | Verification of Hierarchical State/Event Systems Using Reusability and Compositionality
Gerd Behrmann, Kim G. Larsen, Henrik Reif Andersen, Henrik Hulgaard, Jørn Lind-Nielsen |
TACAS | 1 |
| 1998 | Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Jørn Lind-Nielsen, Henrik Reif Andersen, Gerd Behrmann, Henrik Hulgaard, Kåre J. Kristoffersen, Kim G. Larsen |
TACAS | 3 |