H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 54 Citations 10,817 149 World Ranking 2316 National Ranking 9

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Computer network

Theoretical computer science, Finite-state machine, Model checking, Algorithm and Reachability are his primary areas of study. His Theoretical computer science study incorporates themes from Set and Concurrency. His Finite-state machine research is multidisciplinary, incorporating elements of Equivalence, Decidability and Conformance testing.

His Model checking research incorporates elements of Probabilistic automaton and Temporal logic. The Algorithm study combines topics in areas such as Regular expression and Lossy compression. His Reachability research integrates issues from Automaton and Petri net.

His most cited work include:

  • A logic for reasoning about time and reability (1146 citations)
  • Model-Based Testing of Reactive Systems, Advanced Lectures (393 citations)
  • General decidability theorems for infinite-state systems (361 citations)

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

His primary areas of investigation include Theoretical computer science, Model checking, Programming language, Automaton and Algorithm. His Theoretical computer science study combines topics from a wide range of disciplines, such as Finite-state machine, Communications protocol, Semantic data model and Component. His Finite-state machine study deals with Decidability intersecting with State.

His Model checking research includes elements of Stateless protocol, Parameterized complexity, Temporal logic and Concurrency. His biological study spans a wide range of topics, including Discrete mathematics and Transitive closure. His work on Timed automaton, Regular language and Automata theory as part of general Automaton study is frequently linked to Data domain, therefore connecting diverse disciplines of science.

He most often published in these fields:

  • Theoretical computer science (48.61%)
  • Model checking (21.30%)
  • Programming language (18.52%)

What were the highlights of his more recent work (between 2014-2020)?

  • Theoretical computer science (48.61%)
  • Model checking (21.30%)
  • Stateless protocol (4.17%)

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

Bengt Jonsson mostly deals with Theoretical computer science, Model checking, Stateless protocol, Partial order reduction and Parallel computing. His Theoretical computer science study combines topics from a wide range of disciplines, such as Finite-state machine, Disjunctive normal form and Theory of computation. Bengt Jonsson studied Finite-state machine and Data flow diagram that intersect with Software development and Class.

His Model checking study is associated with Algorithm. His study on Stateless protocol also encompasses disciplines like

  • Memory model that connect with fields like Scheme and Axiom,
  • Assertion, which have a strong connection to Redundancy, Use case, Equivalence and Time complexity. His studies in Partial order reduction integrate themes in fields like Basis, Message passing, Combinatorial explosion and Overhead.

Between 2014 and 2020, his most popular works were:

  • Stateless Model Checking for TSO and PSO (69 citations)
  • Active learning for extended finite state machines (54 citations)
  • Generating models of infinite-state communication protocols using regular inference with abstraction (36 citations)

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

  • Programming language
  • Algorithm
  • Computer network

Bengt Jonsson focuses on Theoretical computer science, Model checking, Stateless protocol, POSIX Threads and Parallel computing. His research in Theoretical computer science is mostly focused on Formal verification. His research investigates the link between Stateless protocol and topics such as Memory model that cross with problems in Scheme, Execution model, Axiom and Abstraction model checking.

Bengt Jonsson works mostly in the field of POSIX Threads, limiting it down to topics relating to Partial order reduction and, in certain cases, Overhead, Concurrency, Computational model and Standard model, as a part of the same area of interest. Many of his research projects under Parallel computing are closely connected to Reuse with Reuse, tying the diverse disciplines of science together. His Finite-state machine research incorporates elements of Data flow diagram and Automaton.

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.

Top Publications

A logic for reasoning about time and reability

Hans Hansson;Bengt Jonsson.
Formal Aspects of Computing (1990)

1649 Citations

Model-Based Testing of Reactive Systems, Advanced Lectures

Manfred Broy;Bengt Jonsson;Joost-Pieter Katoen;Martin Leucker.
Lecture Notes in Computer Science (2005)

601 Citations

General decidability theorems for infinite-state systems

P.A. Abdulla;K. Cerans;B. Jonsson;Yih-Kuen Tsay.
logic in computer science (1996)

573 Citations

Verifying programs with unreliable channels

P. Abdulla;B. Jonsson.
logic in computer science (1993)

534 Citations

Specification and refinement of probabilistic processes

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

407 Citations

Regular Model Checking

A. Bouajjani;B. Jonsson;M. Nilsson;T. Touili.
computer aided verification (2000)

365 Citations

A calculus for communicating systems with time and probabilities

H. Hansson;B. Jonsson.
real-time systems symposium (1990)

267 Citations

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

Parosh Aziz Abdulla;Kārlis Čerāns;Bengt Jonsson;Yih-Kuen Tsay.
Information & Computation (2000)

247 Citations

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

Parosh Aziz Abdulla;Ahmed Bouajjani;Bengt Jonsson.
computer aided verification (1998)

202 Citations

Probabilistic Extensions of Process Algebras

Bengt Jonsson;Kim Larsen;Wang Yi.
Handbook of Process Algebra (2001)

192 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Bengt Jonsson

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 114

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 110

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 90

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 77

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 74

Holger Hermanns

Holger Hermanns

Saarland University

Publications: 70

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 69

Christel Baier

Christel Baier

TU Dresden

Publications: 67

Bernhard Steffen

Bernhard Steffen

TU Dortmund University

Publications: 65

Gethin Norman

Gethin Norman

University of Glasgow

Publications: 56

David Parker

David Parker

University of Birmingham

Publications: 53

Frits W. Vaandrager

Frits W. Vaandrager

Radboud University Nijmegen

Publications: 42

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 38

Tiziana Margaria

Tiziana Margaria

University of Limerick

Publications: 37

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 30

Something went wrong. Please try again later.