scientific article; zbMATH DE number 3905833
[For the entire collection see Zbl 0562.00011.] There is a good deal of interest in the problem of how to prove properties, expressed as assertions, hold of a parallel composition of processes by proving assertions hold of the component processes. This paper addresses that problem for a specific programming language and assertion language with a view to understanding the theoretical issues better. The programming language is Robin Milner's Synchronous Calculus of Communicating Systems (SCCS) and the language of assertions is a fragment of dynamic logic (called Hennessy-Milner logic) brought to the fore because, despite its simplicity, it is expressive enough to characterise observational equivalence, central to the work of Milner and others. It is shown how, with respect to each operation in SCCS, every assertion has a decomposition which reduces the problem of proving the assertion holds of a compound process built-up using the operation to proving assertions about its components. These results provide the foundations of a proof system for SCCS with assertions.
- A context dependent equivalence between processes
- An explanatory presentation of composition rules for assumption- commitment specifications
- Composition of assumption-commitment specifications in a UNITY style
- Complete proof systems for weighted modal logic
- Decompositional reasoning about the history of parallel processes
- scientific article; zbMATH DE number 3940709 (Why is no real title available?)
- Compositionality through and operational semantics of contexts
- Modal logics for communicating systems
- Compositional checking of satisfaction
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683529)