- Home
- Best Scientists - Computer Science
- Jan A. Bergstra

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
53
Citations
13,213
568
World Ranking
3157
National Ranking
32

2011 - Royal Netherlands Academy of Arts and Sciences

2006 - Member of Academia Europaea

- Programming language
- Algebra
- Algorithm

Jan A. Bergstra mainly focuses on Algebra, Process calculus, Theoretical computer science, Algebra of Communicating Processes and Programming language. The Algebra study combines topics in areas such as Term algebra, Algebra representation and Pure mathematics. His Process calculus research incorporates elements of Discrete mathematics, Equivalence, Bisimulation, Modulo and Axiom.

He interconnects Halting problem, Turing machine, Basis, Interface and Algebraic theory in the investigation of issues within Theoretical computer science. Jan A. Bergstra has included themes like Simple, Alternating bit protocol, Concurrency and Abstraction in his Algebra of Communicating Processes study. His study on Semantics, Data type and State is often connected to UML state machine as part of broader study in Programming language.

- Process algebra for synchronous communication (806 citations)
- Handbook of Process Algebra (744 citations)
- Algebra of communicating processes with abstraction (572 citations)

Jan A. Bergstra mainly investigates Algebra, Process calculus, Programming language, Theoretical computer science and Discrete mathematics. The study incorporates disciplines such as Term algebra, Algebra of Communicating Processes and Algebra representation in addition to Algebra. His Algebra representation research is multidisciplinary, relying on both Subalgebra and Filtered algebra.

His research in Process calculus intersects with topics in Operator, Discrete time and continuous time, Bisimulation, Concurrency and Asynchronous communication. Programming language connects with themes related to Program algebra in his study. His research integrates issues of Interleaving and Turing machine in his study of Theoretical computer science.

- Algebra (38.84%)
- Process calculus (36.56%)
- Programming language (26.21%)

- Algebra (38.84%)
- Pure mathematics (7.39%)
- Discrete mathematics (21.51%)

Jan A. Bergstra mostly deals with Algebra, Pure mathematics, Discrete mathematics, Instruction sequence and Axiom. Jan A. Bergstra combines subjects such as Process calculus, Propositional calculus and Congruence with his study of Algebra. His Process calculus study also includes fields such as

- Algebra of Communicating Processes which intersects with area such as Hoare logic,
- Property, which have a strong connection to Field.

His work carried out in the field of Discrete mathematics brings together such families of science as Field, Operator and Probability mass function. The Axiom study combines topics in areas such as Scheme, Complex number, Completeness and Real number. His Program algebra study incorporates themes from Programming language, Algebraic theory and Current.

- Division by zero in non-involutive meadows (25 citations)
- Cancellation Meadows (24 citations)
- Division by zero in common meadows (23 citations)

- Programming language
- Algebra
- Algorithm

Jan A. Bergstra focuses on Pure mathematics, Discrete mathematics, Function, Instruction sequence and Arithmetic. His study in Pure mathematics is interdisciplinary in nature, drawing from both Multiplicative inverse, Division by zero, Signature, Axiom and Commutative ring. His Discrete mathematics research is multidisciplinary, incorporating elements of Completeness, Term algebra and Signature.

His study focuses on the intersection of Product and fields such as Financial services with connections in the field of Process calculus. His study looks at the relationship between Process calculus and topics such as Property, which overlap with Algebra. In his research on the topic of Program algebra, Theoretical computer science is strongly related with Programming language.

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.

Process algebra for synchronous communication

Jan A. Bergstra;Jan Willem Klop.

Information & Computation **(1984)**

1423 Citations

Algebra of communicating processes with abstraction

Jan A. Bergstra;Jan Willem Klop.

ifip international conference on theoretical computer science **(1985)**

1050 Citations

Handbook of Process Algebra

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

**(2001)**

885 Citations

Real time process algebra

Jcm Jos Baeten;JA Jan Bergstra;JA Jan Bergstra.

formal methods **(1991)**

578 Citations

Algebraic specification

J. A. Bergstra;Jan Heering;Paul Klint.

**(1989)**

485 Citations

Conditional rewrite rules: confluence and termination

J.A. Bergstra;Jan Willem Klop.

Journal of Computer Science and Technology **(1986)**

335 Citations

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes

Jan A. Bergstra;Jan Willem Klop.

international colloquium on automata, languages and programming **(1984)**

306 Citations

Module algebra

J. A. Bergstra;J. Heering;P. Klint.

Journal of the ACM **(1990)**

287 Citations

Syntax and defining equations for an interrupt mechanism in process algebra

Jcm Jos Baeten;JA Jan Bergstra;JW Jan Willem Klop.

Fundamenta Informaticae **(1986)**

256 Citations

On the consistency of Koomen's fair abstraction rule

J. C. M. Baeten;J. A. Bergstra;J. W. Klop.

ifip international conference on theoretical computer science **(1987)**

220 Citations

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

Contact us

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:

Vrije Universiteit Amsterdam

Centrum Wiskunde & Informatica

Utrecht University

Vrije Universiteit Amsterdam

University of Luxembourg

Centrum Wiskunde & Informatica

Ludwig-Maximilians-Universität München

Stony Brook University

Technical University of Munich

University of Cambridge

French Institute for Research in Computer Science and Automation - INRIA

Publications: 28

University of Pennsylvania

Shandong University of Science and Technology

Tuscia University

Hebrew University of Jerusalem

Forschungszentrum Jülich

National Center for Atmospheric Research

Monash University

Icahn School of Medicine at Mount Sinai

University of Cincinnati

University of Göttingen

University of Pittsburgh

University of Iowa

University of Arizona

University of South Florida

Syracuse University

Stanford University

Something went wrong. Please try again later.