H-Index & Metrics Best Publications
Kim Guldstrand Larsen

Kim Guldstrand Larsen

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 80 Citations 27,466 391 World Ranking 432 National Ranking 2

Research.com Recognitions

Awards & Achievements

2012 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Operating system

Kim Guldstrand Larsen mostly deals with Automaton, Theoretical computer science, Algorithm, Programming language and Reachability. Kim Guldstrand Larsen interconnects Formal verification, Real-time computing, State and Hybrid system in the investigation of issues within Automaton. His research integrates issues of Discrete mathematics and Semantics in his study of Theoretical computer science.

His Algorithm research incorporates themes from Characterization, Probabilistic logic, Representation and Concurrency. His Programming language study combines topics in areas such as Transformation and Simulation. His studies deal with areas such as Distributed computing and Game theory as well as Reachability.

His most cited work include:

  • UPPAAL in a Nutshell (1931 citations)
  • A Tutorial on UPPAAL (1310 citations)
  • Bisimulation through probabilistic testing (1001 citations)

What are the main themes of his work throughout his whole career to date?

Theoretical computer science, Automaton, Model checking, Algorithm and Programming language are his primary areas of study. Kim Guldstrand Larsen has included themes like Probabilistic logic and Correctness in his Theoretical computer science study. His primary area of study in Probabilistic logic is in the field of Probabilistic automaton.

His research in Automaton intersects with topics in Decidability, Semantics, State and Reachability. His Model checking study incorporates themes from Distributed computing, Formal verification, Real-time computing, Scheduling and Data structure. Kim Guldstrand Larsen studies Algorithm, focusing on Computation in particular.

He most often published in these fields:

  • Theoretical computer science (29.80%)
  • Automaton (29.08%)
  • Model checking (23.21%)

What were the highlights of his more recent work (between 2015-2021)?

  • Model checking (23.21%)
  • Theoretical computer science (29.80%)
  • Automaton (29.08%)

In recent papers he was focusing on the following fields of study:

Kim Guldstrand Larsen mainly focuses on Model checking, Theoretical computer science, Automaton, Algorithm and Reachability. His research on Model checking also deals with topics like

  • Distributed computing most often made with reference to Scheduling,

  • Dependency graph, which have a strong connection to Dependency. His Theoretical computer science research also works with subjects such as

  • Petri net which intersects with area such as Fixed point,

  • Probabilistic logic that connect with fields like Semantics.

Kim Guldstrand Larsen has researched Automaton in several fields, including Decidability, Programming language, Control theory and TRACE. His Decidability research includes elements of Bisimulation, Finite model property and Transition system. Kim Guldstrand Larsen combines topics linked to Bounded function with his work on Algorithm.

Between 2015 and 2021, his most popular works were:

  • Contracts for System Design (121 citations)
  • Statistical Model Checking Past, Present, and Future (48 citations)
  • Learning deterministic probabilistic automata from a model checking perspective (30 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Operating system

Kim Guldstrand Larsen focuses on Model checking, Theoretical computer science, Automaton, Algorithm and Petri net. Kim Guldstrand Larsen combines subjects such as Set, Reachability, Dependency graph, Computation and Probabilistic CTL with his study of Model checking. The various areas that Kim Guldstrand Larsen examines in his Theoretical computer science study include Fixed point, Discrete time and continuous time, Correctness, Property and Probabilistic logic.

His Automaton research is multidisciplinary, incorporating perspectives in Computer security, Model-based testing, Test case, TRACE and Cloud computing. The study incorporates disciplines such as Programming language and Verification problem in addition to TRACE. His work carried out in the field of Algorithm brings together such families of science as Test suite and Bisimulation.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

UPPAAL in a Nutshell

Kim Guldstrand Larsen;Paul Pettersson;Wang Yi.
International Journal on Software Tools for Technology Transfer (1997)

2631 Citations

A Tutorial on UPPAAL

Gerd Behrmann;Alexandre David;Kim Guldstrand Larsen.
formal methods (2004)

2002 Citations

Bisimulation through probabilistic testing

Kim G. Larsen;Arne Skou.
Information & Computation (1991)

1494 Citations

UPPAAL—a tool suite for automatic verification of real-time systems

J. Bengtsson;Kim Guldstrand Larsen;F. Larsson;P. Pettersson.
BRICS Report Series (1996)

764 Citations

A modal process logic

K.G. Larsen;B. Thomsen.
logic in computer science (1988)

584 Citations

UPPAAL 4.0

G. Behrmann;A. David;K.G. Larsen;J. Hakansson.
quantitative evaluation of systems (2006)

434 Citations

Minimum-Cost Reachability for Priced Timed Automata

Gerd Behrmann;Ansgar Fehnker;Thomas Hune;Kim Guldstrand Larsen.
acm international conference hybrid systems computation and control (2001)

415 Citations

Specification and refinement of probabilistic processes

B. Jonsson;K.G. Larsen.
logic in computer science (1991)

407 Citations

Reactive Systems: Modelling, Specification and Verification

Luca Aceto;Anna Ingólfsdóttir;Kim Guldstrand Larsen;Jiri Srba.
(2007)

342 Citations

Modal specifications

Kim Guldstrand Larsen.
Proceedings of the international workshop on Automatic verification methods for finite state systems (1989)

341 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Kim Guldstrand Larsen

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 132

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 107

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 102

Holger Hermanns

Holger Hermanns

Saarland University

Publications: 100

Paul Pettersson

Paul Pettersson

Mälardalen University

Publications: 69

Patricia Bouyer

Patricia Bouyer

University of Paris-Saclay

Publications: 67

Christel Baier

Christel Baier

TU Dresden

Publications: 64

Gethin Norman

Gethin Norman

University of Glasgow

Publications: 57

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 56

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 56

Insup Lee

Insup Lee

University of Pennsylvania

Publications: 51

Wang Yi

Wang Yi

Uppsala University

Publications: 50

David Parker

David Parker

University of Birmingham

Publications: 48

Frits W. Vaandrager

Frits W. Vaandrager

Radboud University Nijmegen

Publications: 48

Bernhard Steffen

Bernhard Steffen

TU Dortmund University

Publications: 47

Rance Cleaveland

Rance Cleaveland

University of Maryland, College Park

Publications: 46

Something went wrong. Please try again later.