Rules for trace consistent reasoning (Q4370348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1104444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rules for trace consistent reasoning |
scientific article; zbMATH DE number 1104444 |
Statements
15 July 1999
0 references
propositional temporal logic
0 references
partial-order methods
0 references
axiomatization
0 references
trace consistent formulas
0 references
transition system
0 references
model of distributed systems
0 references
finite-state agents
0 references
common actions
0 references
0.8040218949317932
0 references
0.79169762134552
0 references
Rules for trace consistent reasoning (English)
0 references
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].
0 references