Följ
Jan Aldert Bergstra
Jan Aldert Bergstra
professor of informatics, Institute of Informatics, University of Amsterdam NL
Verifierad e-postadress på uva.nl - Startsida
Titel
Citeras av
Citeras av
År
Process algebra for synchronous communication
JA Bergstra, JW Klop
Information and control 60 (1-3), 109-137, 1984
14841984
Algebra of communicating processes with abstraction
JA Bergstra, JW Klop
Theoretical computer science 37, 77-121, 1985
11031985
Handbook of process algebra
JA Bergstra, A Ponse, SA Smolka
Elsevier, 2001
9352001
Real time process algebra
JCM Baeten, JA Bergstra
Formal Aspects of Computing 3, 142-188, 1991
5781991
Algebraic specification
JA Bergstra
ACM, 1989
4891989
Conditional rewrite rules: Confluence and termination
JA Bergstra, JW Klop
Journal of Computer and System Sciences 32 (3), 323-362, 1986
3281986
Global renaming operators in concrete process algebra
JCM Baeten, JA Bergstra
Information and Computation 78 (3), 205-245, 1988
2801988
Syntax and defining equations for an interrupt mechanism in process algebra
JCM Baeten, JA Bergstra, JW Klop
Fundamenta Informaticae 9 (2), 127-167, 1986
2691986
Module algebra
JA Bergstra, J Heering, P Klint
Journal of the ACM (JACM) 37 (2), 335-372, 1990
2681990
On the consistency of Koomen's fair abstraction rule
JCM Baeten, JA Bergstra, JW Klop
Theoretical Computer Science 51 (1-2), 129-176, 1987
2181987
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
2131984
Algebra of communicating processes
JA Bergstra, JW Klop
Mathematics and Computer Science, CWI Monograph 1 (89-138), 9, 1986
2011986
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
1941993
Algebraic specifications of computable and semicomputable data types
JA Bergstra, JV Tucker
Theoretical Computer Science 50 (2), 137-181, 1987
1851987
A characterisation of computable data types by means of a finite equational specification method
JA Bergstra, JV Tucker
International Colloquium on Automata, Languages, and Programming, 76-90, 1980
1851980
The discrete time TOOLBUS—a software coordination architecture
JA Bergstra, P Klint
Science of Computer programming 31 (2-3), 205-229, 1998
1661998
Program algebra for sequential code
JA Bergstra, ME Loots
The Journal of Logic and Algebraic Programming 51 (2), 125-156, 2002
1632002
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
1621987
Process algebra with iteration and nesting
JA Bergstra, I Bethke, A Ponse
The Computer Journal 37 (4), 243-258, 1994
1591994
Discrete time process algebra
JCM Baeten, JA Bergstra
Formal Aspects of Computing 8, 188-208, 1996
156*1996
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20