25 citations · 290 across the 54 of their papers we have counts for
20 papers · 1 filter
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…
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…
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…
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…
Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
C. A. Middelburg
A variant of the standard notion of branching bisimilarity for processes with discrete relative timing is proposed which is coarser than the standard notion. Using a version of ACP…
Imperative process algebra with abstraction
C. A. Middelburg
This paper introduces an imperative process algebra based on ACP (Algebra of Communicating Processes). Like other imperative process algebras, this process algebra deals with proce…