Temporal Verification of Fault-Tolerant Protocols

DOI10.1007/978-3-642-00867-2_3zbMath1234.68255OpenAlexW1581951460WikidataQ98283674 ScholiaQ98283674MaRDI QIDQ3623816

No author found.

Publication date: 24 April 2009

Published in: Methods, Models and Tools for Fault Tolerance (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00867-2_3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Temporal logic (03B44)

Related Items (1)

Parameterized verification of leader/follower systems via first-order temporal logic

Uses Software

• SPIN
• PVS
• TeMP
• TLPVS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An automatic abstraction technique for verifying featured, parameterised systems
• Decidable fragments of first-order temporal logics
• Axiomatizing the monodic fragment of first-order temporal logic
• Constraint-based verification of parameterized cache coherence protocols
• Mechanising first-order temporal resolution
• Propositional temporal logics: decidability and completeness
• Monodic temporal resolution
• Verification: Theory and Practice
• Automated Reasoning
• Computer Aided Verification
• Proving Liveness by Backwards Reachability

This page was built for publication: Temporal Verification of Fault-Tolerant Protocols