Proving ATL* Properties of Infinite-State Systems
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.
KeywordsRanking Function Proof System Proof Rule Fairness Condition Predicate Transformer
Unable to display preview. Download preview PDF.
- 3.Kremer, S., Raskin, J.F.: A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security 11(3), 399–429 (2003)Google Scholar
- 4.Kremer, S., Raskin, J.F.: Game analysis of abuse-free contract signing. In: Computer Security Foundations Workshop (CSFW). IEEE Computer Society, Los Alamitos (2002)Google Scholar
- 5.Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multi-party contract signing. Journal of Automated Reasoning (to appear, 2006)Google Scholar
- 6.Pauly, M., Wooldridge, M.: Logic for mechanism design—A manifesto. In: Proceedings of the 2003 Workshop on Game Theory and Decision Theory in Agent-Based Systems (GTDT 2003), Melbourne, Australia (2003)Google Scholar
- 7.Lamport, L.: Specifying Systems. Addison-Wesley, Reading (2002)Google Scholar
- 10.Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)Google Scholar
- 14.Slanina, M., Sipma, H.B., Manna, Z.: Proving ATL* properties of infinite-state systems. Technical Report REACT-TR-2006-02, Stanford University, Computer Science Department, REACT Group (2006), avaliable at: http://react.stanford.edu/TR/
- 15.Slanina, M.: Control rules for reactive system games. In: Fischer, B., Smith, D.R. (eds.) Logic-Based Program Synthesis: State of the Art and Future Trends. AAAI Spring Symposium. The American Association for Artificial Intelligenc, pp. 95–104. AAAI Press, Menlo Park (2002); available from AAAI as Technical Report SS-02-05 Google Scholar
- 18.Manna, Z., Pnueli, A.: Temporal verification diagrams. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 726–765. Springer, Heidelberg (1994)Google Scholar