Abstract
In this paper we develop a new method for describing in temporal logic in a compositional manner sequential composition, its iterated version (loops) and its interaction with (nested) parallelism. The logic we will use will be a linear time logic with as sole temporal operator the until. We will illustrate this method in the construction of a compositional proof system for a CSP-like language. We will prove this system to be sound and (relative) complete.
| Original language | English |
|---|---|
| Pages (from-to) | 287-299 |
| Journal | Future Generation Computer Systems |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1990 |