A generalized nexttime operator in temporal logic (Q800722): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90015-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005856245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying concurrent processes using temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite proof rules for loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal semantics of concurrent programs / rank
 
Normal rank

Latest revision as of 15:03, 14 June 2024

scientific article
Language Label Description Also known as
English
A generalized nexttime operator in temporal logic
scientific article

    Statements

    A generalized nexttime operator in temporal logic (English)
    0 references
    0 references
    1984
    0 references
    The paper introduces a new binary operator ''atnext'' into temporal logic generalizing the usual nexttime operator in a straightforward way. Some dualities with the until operator are proved which also show that the new operator has the same expressive power as ''until''. An axiomatization and several proof rules are given. An example (the alternating bit protocol) shows how the operator can profitably be used to describe and prove safety properties of programs.
    0 references
    temporal logic
    0 references
    nexttime operator
    0 references
    until operator
    0 references
    alternating bit protocol
    0 references
    safety properties of programs
    0 references

    Identifiers