J
Jan A. Bergstra
Researcher at University of Amsterdam
Publications - 635
Citations - 13668
Jan A. Bergstra is an academic researcher from University of Amsterdam. The author has contributed to research in topics: Process calculus & Algebra of Communicating Processes. The author has an hindex of 55, co-authored 616 publications receiving 13436 citations. Previous affiliations of Jan A. Bergstra include Centrum Wiskunde & Informatica & Utrecht University.
Papers
More filters
Posted Content
Projection semantics for rigid loops
Jan A. Bergstra,Alban Ponse +1 more
TL;DR: Two different semantic projections are provided and proven equivalent and one is taken to have definitional status on the basis of two criteria: ‘normative semantic adequacy' and ‘indicative algorithmic adequacy’.
Book ChapterDOI
Real Space Process Algebra
TL;DR: In this article, the authors extend the real time process algebra of [BB91] to real space-time process algebra, where actions are not just parametrized by a time coordinate, but also by three spatial coordinates.
Thread extraction for polyadic instruction sequences
TL;DR: This paper formalizes a simple mechanism by which several instruction sequence fragments can produce a joint behaviour and shows that, even in the case of this simple mechanism, it is a non-trivial matter to explain by means of a translation into a single instruction sequence what takes place on execution of a collection of Instruction sequence fragments.
Journal ArticleDOI
Cancellation Meadows
TL;DR: This paper considers ‘cancellation meadows’, i.e. meadows without proper zero divisors, such as ℚ0, and gives an equational axiomatization of these operators and obtains a finite basis for various expanded cancellation meadows.
Book ChapterDOI
Process Algebra with Backtracking
TL;DR: An extension of process algebra for modelling processes with backtracking is introduced in this paper, which is semantically based on processes that transform data because, in their view, backtracking can undoing of the effects caused by a process in some initial data-state if this process fails.