A generalized nexttime operator in temporal logic
From MaRDI portal
Publication:800722
DOI10.1016/0022-0000(84)90015-1zbMATH Open0551.68032OpenAlexW2005856245MaRDI QIDQ800722FDOQ800722
Authors: N. E. Zubov
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90015-1
Recommendations
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Cites Work
- The temporal semantics of concurrent programs
- Proving Liveness Properties of Concurrent Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite proof rules for loops
- Verifying concurrent processes using temporal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Arithmetical axiomatization of first-order temporal logic
- Title not available (Why is that?)
- ``During cannot be expressed by ``after
- A complete axiomatic characterization of first-order temporal logic of linear time
- Time-extraction for temporal logic -- logic programming and local process time
- Incompleteness of first-order temporal logic with until
- Title not available (Why is that?)
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)