- Home
- Best Scientists - Engineering and Technology
- Jan Rutten

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

Engineering and Technology
D-index
31
Citations
5,604
126
World Ranking
5364
National Ranking
104

- Programming language
- Algebra
- Real number

Jan Rutten mainly focuses on Coalgebra, Coinduction, Programming language, Algebra and Bisimulation. His Coinduction study is focused on Mathematical proof in general. Jan Rutten works mostly in the field of Programming language, limiting it down to concerns involving Theoretical computer science and, occasionally, Component and Well-founded semantics.

Algebra and Discrete mathematics are commonly linked in his work. His biological study spans a wide range of topics, including Automata theory and Homomorphism. His Homomorphism research includes elements of Variety and Universal algebra.

- Universal coalgebra: a theory of systems (1037 citations)
- Modeling component connectors in Reo by constraint automata (300 citations)
- Solving reflexive domain equations in a category of complete metric spaces (178 citations)

His primary areas of investigation include Algebra, Coalgebra, Discrete mathematics, Coinduction and Automaton. His Algebra study incorporates themes from Finite-state machine, Regular expression, Bisimulation and Automata theory. Coalgebra is the subject of his research, which falls under Pure mathematics.

His Discrete mathematics study combines topics from a wide range of disciplines, such as Variety, Deterministic automaton, Reachability and Metric. His studies in Coinduction integrate themes in fields like Function, Formal power series, Calculus and Formal language. Jan Rutten has included themes like Equivalence, Programming language and Algorithm in his Automaton study.

- Algebra (37.33%)
- Coalgebra (33.64%)
- Discrete mathematics (32.26%)

- Algebra (37.33%)
- Coalgebra (33.64%)
- Equivalence (18.43%)

His primary areas of study are Algebra, Coalgebra, Equivalence, Automaton and Discrete mathematics. His Algebra research is multidisciplinary, relying on both Operational semantics and Nondeterministic algorithm. His Coalgebra study is concerned with the larger field of Pure mathematics.

The various areas that Jan Rutten examines in his Equivalence study include Programming language, Concurrency, Equivalence, Mathematical proof and Algorithm. His work carried out in the field of Mathematical proof brings together such families of science as Regular expression, Bisimulation, Theoretical computer science and Kleene star. His Automaton research incorporates elements of Functor, Coinduction and Congruence relation.

- Generalizing determinization from automata to coalgebras (99 citations)
- Algebra-coalgebra duality in brzozowski's minimization algorithm (49 citations)
- A coalgebraic perspective on linear weighted automata (44 citations)

- Programming language
- Algebra
- Real number

Jan Rutten mainly focuses on Coalgebra, Algebra, Discrete mathematics, Equivalence and Coinduction. His studies deal with areas such as Duality, Correctness and Reachability as well as Coalgebra. His primary area of study in Algebra is in the field of Formal power series.

His Discrete mathematics study integrates concerns from other disciplines, such as ω-automaton, Deterministic automaton, Universal algebra and Automata theory. His Equivalence study combines topics in areas such as Programming language, Bisimulation, Automaton, Mathematical proof and Cable gland. His Coinduction research incorporates themes from Theoretical computer science, Subtyping, Tree, Pure mathematics and Set.

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.

Universal coalgebra: a theory of systems

J. J. M. M. Rutten.

Theoretical Computer Science **(2000)**

1651 Citations

Modeling component connectors in Reo by constraint automata

Christel Baier;Marjan Sirjani;Farhad Arbab;Jan Rutten.

Science of Computer Programming **(2006)**

365 Citations

Solving reflexive domain equations in a category of complete metric spaces

P.H.M. America;J.J.M.M. Rutten.

Journal of Computer and System Sciences **(1989)**

313 Citations

Automata and Coinduction (An Exercise in Coalgebra)

J. J. M. M. Rutten.

international conference on concurrency theory **(1998)**

293 Citations

Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems

J. J. Rutten;Marta Kwiatkowska;Gethin Norman;David Parker.

CRM Monograph Series **(2004)**

266 Citations

Advanced Topics in Bisimulation and Coinduction

Davide Sangiorgi;Jan Rutten.

Advanced Topics in Bisimulation and Coinduction 1st **(2011)**

247 Citations

Bisimulation for probabilistic transition systems: a coalgebraic approach

E. P. de Vink;J. J. M. M. Rutten.

Theoretical Computer Science **(1999)**

229 Citations

Behavioural differential equations: a coinductive calculus of streams, automata, and power series

J. J. M. M. Rutten.

Theoretical Computer Science **(2003)**

224 Citations

A coinductive calculus of component connectors

F. Arbab;J. J. M. M. Rutten.

Lecture Notes in Computer Science **(2003)**

215 Citations

Initial algebra and final coalgebra semantics for concurrency.

J.J.M.M. Rutten;D. Turi.

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium **(1993)**

163 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:

Leiden University

University of Twente

Radboud University Nijmegen

Centrum Wiskunde & Informatica

French Institute for Research in Computer Science and Automation - INRIA

TU Dresden

Centrum Wiskunde & Informatica

University of Glasgow

University of Oxford

University of Oxford

French Institute for Research in Computer Science and Automation - INRIA

Publications: 17

University of Göttingen

Columbia University

National Institute of Amazonian Research

MRAG Ltd

Freie Universität Berlin

Tohoku University

Inserm : Institut national de la santé et de la recherche médicale

Indian Council of Agricultural Research

University of New Hampshire

University College London

Washington University in St. Louis

Fred Hutchinson Cancer Research Center

Northwestern University

Brigham and Women's Hospital

University of Pecs

University at Buffalo, State University of New York

Something went wrong. Please try again later.