World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
53
Citations
11342
World Ranking
4823
National Ranking
2243

Research.com Recognitions

  • 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

Scott A. Smolka is affiliated with Stony Brook University in the United States. Their research spans multiple fields, primarily Computer Science and Engineering, with a strong focus on subfields such as Artificial Intelligence, Computational Theory and Mathematics, Control and Systems Engineering, Safety, Risk, Reliability and Quality, and Electrical and Electronic Engineering.

Their work covers a range of topics, including:

  • Formal Methods in Verification
  • Adversarial Robustness in Machine Learning
  • Safety Systems Engineering in Autonomy
  • Smart Grid Security and Resilience
  • Machine Learning and Algorithms
  • Distributed Control Multi-Agent Systems
  • Advanced Control Systems Optimization

Recent publications by Scott A. Smolka include:

  • "Swarm model checking on the GPU," 2020, International Journal on Software Tools for Technology Transfer
  • "Neural predictive monitoring and a comparison of frequentist and Bayesian approaches," 2021, International Journal on Software Tools for Technology Transfer
  • "On the Verification of Neural ODEs with Stochastic Guarantees," 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "A distributed simplex architecture for multi-agent systems," 2022, Journal of Systems Architecture
  • "GoTube: Scalable Statistical Verification of Continuous-Depth Models," 2022, Proceedings of the AAAI Conference on Artificial Intelligence

Scott A. Smolka frequently publishes in the following venues:

  • arXiv (Cornell University)
  • International Journal on Software Tools for Technology Transfer
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • IEEE Access
  • Journal of Systems Architecture

Frequent collaborators of this researcher include:

  • Scott D. Stoller
  • Radu Grosu
  • Nicola Paoletti
  • Usama Mehmood
  • Shouvik Roy

Scott A. Smolka was recognized as a European Association for Theoretical Computer Science (EATCS) Fellow in 2016. The award citation noted contributions to process algebra, model checking, probabilistic processes, runtime verification, and applications to cardiac-cell modelling and analysis.

Best Publications

  • CCS expressions finite state processes, and three problems of equivalence

    Paris C. Kanellakis;Scott A. Smolka

  • Handbook of Process Algebra

    J. A. Bergstra;A. Ponse;Scott A. Smolka

  • Reactive, generative, and stratified models of probabilistic processes

    Rob J. VanGlabbeek;Scott A. Smolka;Bernhard Steffen

  • Reactive, generative, and stratified models of probabilistic processes

    R. van Glabbeek;S.A. Smolka;B. Steffen;C.M.N. Tofts

  • Monte Carlo model checking

    Radu Grosu;Scott A. Smolka

  • Algebraic Reasoning for Probabilistic Concurrent Systems.

    Alessandro Giacalone;Chi-Chang Jou;Scott A. Smolka

  • Efficient Model Checking Using Tabled Resolution

    Y. S. Ramakrishna;C. R. Ramakrishnan;I. V. Ramakrishnan;Scott A. Smolka

  • Equivalences, congruences, and complete axiomatizations for probabilistic processes

    Chi-Chang Jou;Scott A. Smolka

  • Interactive Computation: The New Paradigm

    Dina Goldin;Scott A. Smolka;Peter Wegner

  • Composition and behaviors of probabilistic I/O automata

    Sue-Hwey Wu;Scott A. Smolka;Eugene W. Stark

  • A process calculus for Mobile Ad Hoc Networks

    Anu Singh;C. R. Ramakrishnan;Scott A. Smolka

  • Model repair for probabilistic systems

    Ezio Bartocci;Radu Grosu;Panagiotis Katsaros;C. R. Ramakrishnan

  • Runtime verification with state estimation

    Scott D. Stoller;Ezio Bartocci;Justin Seyster;Radu Grosu

  • Turing machines, transition systems, and interaction

    Dina Q. Goldin;Scott A. Smolka;Paul C. Attie;Elaine L. Sonderegger

  • CONCUR '95: Concurrency Theory

    Insup Lee;Scott A. Smolka

  • Axiomatizing probabilistic processes: ACP with generative probabilities

    J. C. M. Baeten;J. A. Bergstra;S. A. Smolka

  • Incremental Model Checking in the Modal Mu-Calculus

    Oleg Sokolsky;Scott A. Smolka

  • From cardiac cells to genetic regulatory networks

    Radu Grosu;Gregory Batt;Flavio H. Fenton;James Glimm

  • On randomization in sequential and distributed algorithms

    Rajiv Gupta;Scott A. Smolka;Shaji Bhaskar

  • A Compositional Semantics for Statecharts using Labeled Transition Systems

    Andrew C. Uselton;Scott A. Smolka

  • Testing Preorders for Probabilistic Processes

    Rance Cleaveland;Zeynep Dayar;Scott A. Smolka;Shoji Yuen

  • Reactive, generative, and stratified models of probabilistic processes

    R.J. vanGlabbeek;S.A. Smolka;B. Steffen;C.M.N. Tofts

Frequent Co-Authors

Radu Grosu
Radu Grosu TU Wien
Scott D. Stoller
Scott D. Stoller Stony Brook University
Rance Cleaveland
Rance Cleaveland University of Maryland, College Park
Ashish Tiwari
Ashish Tiwari Microsoft (United States)
Erez Zadok
Erez Zadok Stony Brook University
I. V. Ramakrishnan
I. V. Ramakrishnan Stony Brook University
Oleg Sokolsky
Oleg Sokolsky University of Pennsylvania
James Glimm
James Glimm Stony Brook University
Insup Lee
Insup Lee University of Pennsylvania

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education options in Computer Science opens the door to numerous degree types and career opportunities. Many students begin their journey with associates degrees online. These programs offer a flexible pathway for building foundational skills and can lead to entry-level positions or further study.

Budget is a critical concern for many learners. There are several options among the cheapest online college programs, making quality Computer Science education more accessible than ever before.

Academic backgrounds vary, but prospective students with less competitive transcripts still have options. Numerous online colleges that accept low gpa ensure that motivated individuals can pursue their degree and start building their tech careers.

A background in Computer Science can also enhance opportunities in other growing fields. For instance, blending technical skills with environmental studies opens paths in sustainability, data analysis, and policy. Curious about possibilities? Discover what can i do with an environmental science degree to see how interdisciplinary learning can shape your future.

Best Scientists Citing Scott A. Smolka

Trending Scientists

Recently Published Articles