Invariants, composition, and substitution (Q1894676): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: UNITY / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ''Hoare logic'' of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on ''Always-true is not invariant'': Assertional reasoning about invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating the substitution axiom from UNITY logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on ``On the proof of a distributed algorithm'': Always-true is not invariant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681905 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01178381 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4246478125 / rank
 
Normal rank

Latest revision as of 09:40, 30 July 2024

scientific article
Language Label Description Also known as
English
Invariants, composition, and substitution
scientific article

    Statements

    Invariants, composition, and substitution (English)
    0 references
    0 references
    24 July 1995
    0 references
    In the literature the notion of a system invariant has been formalized in two different ways, differing in the treatment of unreachable transitions. We call the more general notion, which ignores unreachable transitions, invariant sets of a system, the more restricted notion, which considers unreachable transitions, inductive sets of a system. It turns out that even if we are only interested in invariant sets of a system, inductive sets play an important role for proving invariant sets of a system in a compositional way. This paper shows the interplay of both kinds of invariants; particularly, we show that inductive sets are fully abstract with respect to invariant sets. One essential difference between invariant and inductive sets is that the substitution rule is only valid for invariant sets, and the composition rule is only valid for inductive sets. Sometimes it seems desirable to have a notion of invariants for which both rules are valid. We show that every notion of an invariant enjoying both rules is very restrictive.
    0 references
    invariant sets
    0 references
    inductive sets
    0 references
    composition rule
    0 references

    Identifiers