Rules for trace consistent reasoning

From MaRDI portal





The paper deals with linear time propositional temporal logic (PTL), and focuses on trace consistent formulas, i.e., those which do not distinguish between two interleavings of the same (partially-ordered) run in the underlying transition system. This notion was previously studied from the `model-checking viewpoint', while here the author applies an axiomatic approach. He chooses a structurally straightforward subset of PTL and a simple model of distributed systems -- finite-state agents which are synchronized via common actions. Then he elaborates a complete axiomatization system for the valid formulas, which is a nontrivial task despite of the simplicity of the chosen setting. Besides giving the mentioned technical result, the paper adds some insight how to separate the properties which can be analyzed locally from those which have to be analyzed globally in a distributed system. For the entire collection see [Zbl 0878.00079].











This page was built for publication: Rules for trace consistent reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370348)