6 papers
Probabilistic imperative process algebra
C. A. Middelburg
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originat…
The most natural paradefinite logic relative to classical logic
C. A. Middelburg
A paradefinite logic is a logic that can serve as the underlying logic for theories that are inconsistent or incomplete. A well-known paradefinite logic is Belnap-Dunn logic. Vario…
Formalizing the notions of non-interactive and interactive algorithms
C. A. Middelburg
An earlier paper gives an account of a quest for a satisfactory formalization of the classical informal notion of an algorithm. That notion only covers algorithms that are determin…
Complementing an imperative process algebra with a rely/guarantee logic
C. A. Middelburg
This paper concerns the relation between imperative process algebra and rely/guarantee logic. An imperative process algebra is complemented by a rely/guarantee logic that can be us…
The interdefinability of expansions of Belnap-Dunn logic
C. A. Middelburg
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For variou…
Space-time process algebra with asynchronous communication
J. A. Bergstra, C. A. Middelburg
We introduce a process algebra that concerns the timed behaviour of distributed systems with a known spatial distribution. This process algebra provides a communication mechanism t…