A generalized nexttime operator in temporal logic
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3564294 (Why is no real title available?)
- scientific article; zbMATH DE number 3581596 (Why is no real title available?)
- scientific article; zbMATH DE number 3624762 (Why is no real title available?)
- scientific article; zbMATH DE number 3415379 (Why is no real title available?)
- Infinite proof rules for loops
- Proving Liveness Properties of Concurrent Programs
- The temporal semantics of concurrent programs
- Verifying concurrent processes using temporal logic
Cited in
(7)- ``During cannot be expressed by ``after
- Arithmetical axiomatization of first-order temporal logic
- A complete axiomatic characterization of first-order temporal logic of linear time
- Incompleteness of first-order temporal logic with until
- Time-extraction for temporal logic -- logic programming and local process time
- scientific article; zbMATH DE number 3898203 (Why is no real title available?)
- scientific article; zbMATH DE number 3943779 (Why is no real title available?)
This page was built for publication: A generalized nexttime operator in temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800722)