Verifying concurrent processes using temporal logic
From MaRDI portal
Publication:1159976
zbMATH Open0476.68015MaRDI QIDQ1159976FDOQ1159976
Publication date: 1982
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cited In (11)
- Removing irrelevant information in temporal resolution proofs
- Automated temporal reasoning about reactive systems
- Specification and verification of database dynamics
- Towards a foundation for semantics in complete metric spaces
- Control problems in a temporal logic framework
- The sliding-window protocol revisited
- Expressibility of output equals input. Negative and positive results
- Search strategies for resolution in temporal logics
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- A generalized nexttime operator in temporal logic
- Exposure to deadlock for communicating processes is hard to detect
This page was built for publication: Verifying concurrent processes using temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159976)
