Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
Temporal Verification Diagrams
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Completing the Temporal Picture
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
Formal Analysis of Multiparty Contract Signing
Journal of Automated Reasoning
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
| Hi-index | 0.00 |
Alternating temporal logic (atl*) was introduced to prove properties of multi-agent systems in which the agents have different objectives and may collaborate to achieve them. Examples include (distributed) controlled systems, security protocols, and contract-signing protocols. Proving atl* properties over finite-state systems was shown decidable by Alur et al., and a model checker for the sublanguage atl implemented in mocha. In this paper we present a sound and complete proof system for proving alt* properties over infinite-state systems. The proof system reduces proofs of alt* properties over systems to first-order verification conditions in the underlying assertion language. The verification conditions make use of predicate transformers that depend on the system structure, so that proofs over systems with a simpler structure, e.g., turn-based systems, directly result in simpler verification conditions. We illustrate the use of the proof system on a small example.