D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 42 Citations 7,748 178 World Ranking 4065 National Ranking 2062

Research.com Recognitions

Awards & Achievements

2016 - European Association for Theoretical Computer Science (EATCS) Fellow For fundamental contributions to process algebra, model checking, probabilistic processes, runtime verification, and more recently for the successful application of most of these theories to cardiac-cell modelling and analysis

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Algorithm

Scott A. Smolka mainly focuses on Theoretical computer science, Probabilistic logic, Algorithm, Concurrency and Model checking. The study incorporates disciplines such as Bisimulation and Generative grammar in addition to Probabilistic logic. His research in Bisimulation intersects with topics in Process calculus and Operational semantics.

His Algorithm research includes themes of Sampling, Mathematical optimization and Temporal logic. The concepts of his Concurrency study are interwoven with issues in Equivalence, Key and Algebraic number. His study in Model checking is interdisciplinary in nature, drawing from both Fragment, Automaton, Hybrid system and Logic programming.

His most cited work include:

  • Handbook of Process Algebra (744 citations)
  • CCS expressions finite state processes, and three problems of equivalence (487 citations)
  • Reactive, generative, and stratified models of probabilistic processes (325 citations)

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

Scott A. Smolka spends much of his time researching Model checking, Theoretical computer science, Algorithm, Programming language and Probabilistic logic. He combines subjects such as Formal verification, State space, Logic programming and Concurrency with his study of Model checking. The Theoretical computer science study combines topics in areas such as Computational complexity theory, Distributed algorithm and Property.

Scott A. Smolka has included themes like Automaton and Bounded function in his Algorithm study. His study on Probabilistic logic is mostly dedicated to connecting different topics, such as Discrete mathematics. His Process calculus research includes elements of Bisimulation and Operational semantics.

He most often published in these fields:

  • Model checking (24.44%)
  • Theoretical computer science (22.59%)
  • Algorithm (18.89%)

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

  • Algorithm (18.89%)
  • Reachability (8.52%)
  • Control theory (8.15%)

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

Scott A. Smolka focuses on Algorithm, Reachability, Control theory, Artificial intelligence and Model checking. He works in the field of Algorithm, focusing on Computation in particular. His Reachability research is multidisciplinary, incorporating perspectives in Set, Probabilistic logic, Hybrid automaton, Hybrid system and Applied mathematics.

His Probabilistic logic study combines topics in areas such as Property, Theoretical computer science and State. His biological study spans a wide range of topics, including Semantics and Parallel computing. His Semantics study which covers Complexity class that intersects with Algebra and State.

Between 2013 and 2021, his most popular works were:

  • A survey on unmanned aerial vehicle collision avoidance systems (34 citations)
  • Using Statistical Model Checking for Measuring Systems (19 citations)
  • Towards a GPGPU-parallel SPIN model checker (18 citations)

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

  • Programming language
  • Operating system
  • Algorithm

Scott A. Smolka mainly investigates Algorithm, Bounded function, Control theory, Model checking and Probabilistic logic. The various areas that Scott A. Smolka examines in his Algorithm study include Path, Bisimulation, Theoretical computer science and Sequence. His Deterministic finite automaton study, which is part of a larger body of work in Theoretical computer science, is frequently linked to System identification, bridging the gap between disciplines.

His research integrates issues of Mathematical optimization and Flocking, Artificial intelligence in his study of Control theory. Scott A. Smolka has researched Model checking in several fields, including System model, Soundness, Complexity class, Reachability and Semantics. His Probabilistic logic research is multidisciplinary, relying on both Computer security, Network packet and State.

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

Handbook of Process Algebra

J. A. Bergstra;A. Ponse;Scott A. Smolka.
(2001)

871 Citations

CCS expressions finite state processes, and three problems of equivalence

Paris C. Kanellakis;Scott A. Smolka.
Information & Computation (1990)

858 Citations

Reactive, generative, and stratified models of probabilistic processes

Rob J. VanGlabbeek;Scott A. Smolka;Bernhard Steffen.
Information & Computation (1995)

662 Citations

Reactive, generative, and stratified models of probabilistic processes

R. van Glabbeek;S.A. Smolka;B. Steffen;C.M.N. Tofts.
logic in computer science (1990)

615 Citations

Algebraic Reasoning for Probabilistic Concurrent Systems.

Alessandro Giacalone;Chi-Chang Jou;Scott A. Smolka.
Programming Concepts and Methods (1990)

313 Citations

Efficient Model Checking Using Tabled Resolution

Y. S. Ramakrishna;C. R. Ramakrishnan;I. V. Ramakrishnan;Scott A. Smolka.
computer aided verification (1997)

297 Citations

Interactive Computation: The New Paradigm

Dina Goldin;Scott A. Smolka;Peter Wegner.
(2006)

261 Citations

Equivalences, congruences, and complete axiomatizations for probabilistic processes

Chi-Chang Jou;Scott A. Smolka.
international conference on concurrency theory (1990)

260 Citations

Monte carlo model checking

Radu Grosu;Scott A. Smolka.
tools and algorithms for construction and analysis of systems (2005)

228 Citations

Composition and behaviors of probabilistic I/O automata

Sue-Hwey Wu;Scott A. Smolka;Eugene W. Stark.
Theoretical Computer Science (1997)

171 Citations

Best Scientists Citing Scott A. Smolka

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 73

Rance Cleaveland

Rance Cleaveland

University of Maryland, College Park

Publications: 48

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 47

Holger Hermanns

Holger Hermanns

Saarland University

Publications: 43

Christel Baier

Christel Baier

TU Dresden

Publications: 38

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 37

Andrzej Skowron

Andrzej Skowron

University of Warsaw

Publications: 35

Insup Lee

Insup Lee

University of Pennsylvania

Publications: 29

Radu Grosu

Radu Grosu

TU Wien

Publications: 29

Wan Fokkink

Wan Fokkink

Vrije Universiteit Amsterdam

Publications: 29

Jan Friso Groote

Jan Friso Groote

Eindhoven University of Technology

Publications: 28

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 28

Rob van Glabbeek

Rob van Glabbeek

Stanford University

Publications: 26

Rocco De Nicola

Rocco De Nicola

IMT Institute for Advanced Studies Lucca

Publications: 26

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 25

Roberto Gorrieri

Roberto Gorrieri

University of Bologna

Publications: 23

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-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
Something went wrong. Please try again later.