Compositionality in the temporal logic of concurrent systems
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.
|International Conference on Parallel Architectures and Languages Europe - PARLE|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
de Boer, F.S. (1989). Compositionality in the temporal logic of concurrent systems. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 406–423). doi:10.1007/3-540-51285-3_55