| Term rewriting systems JW Klop, JW Klop Centrum voor Wiskunde en Informatica, 1990 | 1870* | 1990 |
| Process algebra for synchronous communication JA Bergstra, JW Klop Information and control 60 (1-3), 109-137, 1984 | 1496 | 1984 |
| Algebra of communicating processes with abstraction JA Bergstra, JW Klop Theoretical computer science 37, 77-121, 1985 | 1120 | 1985 |
| Combinatory reduction systems JW Klop Rijksuniversiteit Utrecht, 2022 | 917 | 2022 |
| Combinatory reduction systems: introduction and survey JW Klop, V Van Oostrom, F Van Raamsdonk Theoretical computer science 121 (1-2), 279-308, 1993 | 408 | 1993 |
| Conditional rewrite rules: Confluence and termination JA Bergstra, JW Klop Journal of Computer and System Sciences 32 (3), 323-362, 1986 | 327 | 1986 |
| Syntax and defining equations for an interrupt mechanism in process algebra JCM Baeten, JA Bergstra, JW Klop Fundamenta Informaticae 9 (2), 127-167, 1986 | 278 | 1986 |
| On the consistency of Koomen's fair abstraction rule JCM Baeten, JA Bergstra, JW Klop Theoretical Computer Science 51 (1-2), 129-176, 1987 | 229 | 1987 |
| The algebra of recursively defined processes and the algebra of regular processes JA Bergstra, JW Klop International Colloquium on Automata, Languages, and Programming, 82-94, 1984 | 221 | 1984 |
| Infinitary lambda calculus JR Kennaway, JW Klop, MR Sleep, FJ de Vries Theoretical Computer Science 175 (1), 93-125, 1997 | 214 | 1997 |
| Algebra of communicating processes JA Bergstra, JW Klop CWI Monograph series 3, 89-138, 1986 | 210 | 1986 |
| Transfinite reductions in orthogonal term rewriting systems R Kennaway, JW Klop, R Sleep, FJ Devries Information and computation 119 (1), 18-38, 1995 | 204 | 1995 |
| Decidability of bisimulation equivalence for process generating context-free languages JCM Baeten, JA Bergstra, JW Klop Journal of the ACM (JACM) 40 (3), 653-682, 1993 | 201 | 1993 |
| Equational term graph rewriting ZM Ariola, JW Klop Centrum voor Wiskunde en Informatica, 1995 | 182 | 1995 |
| Term rewriting systems: a tutorial JW Klop Bulletin of the European Association for Theoretical Computer Science, 1987 | 177 | 1987 |
| Decidability of bisimulation equivalence for processes generating context-free languages JCM Baeten, JA Bergstra, JW Klop International Conference on Parallel Architectures and Languages Europe, 94-111, 1987 | 175 | 1987 |
| Fixed point semantics in process algebras JA Bergstra, JW Klop | 169 | 1982 |
| Verification of an alternating bit protocol by means of process algebra protocol JA Bergstra, JW Klop Int. Spring School on Mathematical Methods of Specification and Synthesis of …, 1985 | 157 | 1985 |
| Process theory based on bisimulation semantics JA Bergstra, JW Klop Workshop/School/Symposium of the REX Project (Research and Education in …, 1988 | 138 | 1988 |
| Process algebra: specification and verification in bisimulation semantics JA Bergstra CWI monographs 4, 61-94, 1986 | 134 | 1986 |
Jan Aldert Bergstraprofessor of informatics, Institute of Informatics, University of Amsterdam NLVerified email at uva.nl
