Abstraction-based verification of infinite-state reactive modules
Pages 725 - 733
Abstract
We introduce the formalism of infinite-state reactive modules to reason about the strategic behaviour of autonomous agents in a setting where data are explicitly exhibited in the systems description and in the specification language. Technically, we endow reactive modules with an infinite domain of interpretation for individual variables, and introduce FO-ATL, a first-order version of alternating time temporal logic, for the specification of properties of interest. We show that their verification is decidable for classes of data types of interest. This result is proved by defining a first-order version of alternating bisimulations and finite bisimilar abstractions. We illustrate the formal machinery by applying it to English and sealed bid auctions. In particular, we show that strategic properties of agents in auctions, including manipulability and collusion, can be expressed and verified in this framework.
References
[1]
S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, Addison-Wesley, 1995.
[2]
T. Ågotnes, V. Goranko, W. Jamroga, and M. Wooldridge, 'Knowledge and ability', in Handbook of Logics for Knowledge and Belief, College Publications, (2015).
[3]
R. Alur, L. de Alfaro, R. Grosu, T. Henzinger, A. Thomas, M. Kang, C. Kirsch, R. Majumdar F. Mang, and B-Y. Wang, 'jMocha: A model checking tool that exploits design structure', in Proceedings of the 23rd International Conference on Software Engineering (ICSE01), pp. 835-836. IEEE, (2001).
[4]
R. Alur and T. Henzinger, 'Reactive modules', Formal Methods in System Design, 15(1), 7-48, (1999).
[5]
R. Alur, T. A. Henzinger, and O. Kupferman, 'Alternating-time temporal logic', Journal of the ACM, 49(5), 672-713, (2002).
[6]
A. Badica and C. Badica, 'Specification and verification of an agent-based auction service', in Information Systems Development, 239-248, Springer US, (2010).
[7]
B. Bagheri, D. Calvanese, M. Montali, G. Giacomo, and A. Deutsch, 'Verification of relational data-centric dynamic systems with external services', in Proceedings of the 32nd Symposium on Principles of Database Systems (PODS13), pp. 163-174. ACM, (2013).
[8]
T. Ball and O. Kupferman, 'An abstraction-refinement framework for multi-agent systems', in Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS06), pp. 379-388. IEEE, (2006).
[9]
F. Belardinelli, 'Model checking auctions as artifact systems: Decidability via finite abstraction', in Proceedings of the 21st European Conference on Artificial Intelligence (ECAI14), pp. 81-86, (2014).
[10]
F. Belardinelli, A. Lomuscio, and F. Patrizi, 'Verification of agent-based artifact systems', Journal of Artificial Intelligence Research, 51, 333-376, (2014).
[11]
K. Bhattacharya, C. Gerede, R. Hull, R. Liu, and J. Su, 'Towards formal analysis of artifact-centric business process models', in Business Process Management: Proceedings of the 5th International Conference (BPM07), pp. 288-304. Springer, (2007).
[12]
N. Bulling, J. Dix, and W. Jamroga, 'Model checking logics of strategic ability: Complexity', in Specification and Verification of Multi-agent Systems, 125-159, Springer, (2010).
[13]
N. Bulling and W. Jamroga, 'Comparing variants of strategic ability: how uncertainty and memory influence general properties of games', Autonomous Agents and Multi-Agent Systems, 28(3), 474-518, (2014).
[14]
D. Calvanese, G. Delzanno, and M. Montali, 'Verification of relational multiagent systems with data types', in Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI15), pp. 2031-2037. AAAI Press, (2015).
[15]
K. Chatterjee, T. Henzinger, and N. Piterman, 'Strategy logic', in Proceedings of the 18th International Conference on Concurrency Theory (CONCUR07), volume 4703, pp. 59-73, (2007).
[16]
M. Cohen, M. Dam, A. Lomuscio, and H. Qu, 'A symmetry reduction technique for model checking temporal-epistemic logic', in Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI09), pp. 721-726, (2009).
[17]
G. de Giacomo, Y. Lesperance, F. Patrizi, and S. Vassos, 'Progression and verification of situation calculus agents with bounded beliefs', in Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems (AAMAS14), pp. 141-148. IFAAMAS, (2014).
[18]
A. Deutsch, R. Hull, F. Patrizi, and V. Vianu, 'Automatic verification of data-centric business processes', in Proceedings of the 12th International Conference on Database Theory (ICDT09), pp. 252-267. ACM, (2009).
[19]
A. Deutsch, Y. Li, and V. Vianu, 'Verification of hierarchical artifact systems'.
[20]
D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, New York, NY, USA, 2010.
[21]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi, Reasoning about Knowledge, MIT Press, Cambridge, 1995.
[22]
G. De Giacomo, Y. Lesperance, and F. Patrizi, 'Bounded epistemic situation calculus theories', in Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI13), (2013).
[23]
P. Gonzalez, A. Griesmayer, and A. Lomuscio, 'Verification of GSM-based artifact-centric systems by predicate abstraction', in Proceedings of the 13th International Conference on Service Oriented Computing (ICSOC15), volume 9435 of Lecture Notes in Computer Science, pp. 253-268. Springer, (2015).
[24]
E. M. Tadjouddine F. Guerin and W. Vasconcelos, 'Abstractions for model-checking game-theoretic properties of auctions', in Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems (AAMAS08), pp. 1613-1616. IFAAMAS, (2008).
[25]
A. G. Hamilton, Logic for Mathematicians, Cambridge University Press, 1978.
[26]
W. Jamroga and T. Ågotnes, 'Modular interpreted systems', in Proceedings of the 6th International Conference on Autonomous Agents and Multi-Agent systems (AAMAS07), pp. 131-138. IFAAMAS, (2007).
[27]
W. Jamroga and J. Dix, 'Model checking abilities under incomplete information is indeed δp2-complete', in Proceedings of the 4th European Workshop on Multi-Agent Systems (EUMAS'06), pp. 14-15, (2006).
[28]
W. Jamroga and W. van der Hoek, 'Agents that know how to play', Fundamenta Informaticae, 62, 1-35, (2004).
[29]
A. Lomuscio and J. Michaliszyn, 'Verification of multi-agent systems via predicate abstraction against ATLK specifications', in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS16), (2016).
[30]
A. Lomuscio, H. Qu, and F. Raimondi, 'MCMAS: A model checker for the verification of multi-agent systems', Software Tools for Technology Transfer, (2015).
[31]
F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi, 'Reasoning about strategies: On the model-checking problem', ACM Transactions in Computational Logic, 15(4), 34:1-34:47, (2014).
[32]
N. Nisan, J. Bayer, D. Chandra, Tal Franji, R. Gardner, Y. Matias, N. Rhodes, M. Seltzer, D. Tom, Hal Varian, and D. Zigmond, 'Google's auction for TV ads', in Automata, Languages and Programming, 36th Internatilonal Colloquium (ICALP09), Proceedings, pp. 309-327. Springer, (2009).
[33]
W. van der Hoek, A. Lomuscio, and M. Wooldridge, 'On the complexity of practical ATL model checking knowledge, strategies, and games in multi-agent systems', in Proceedings of the 5th international joint conference on Autonomous agents and multiagent systems (AAMAS06), pp. 201-208. ACM Press, (2006).
[34]
H. Xu, C. K. Bates, and S. M. Shatz, 'Real-time model checking for shill detection in live online auctions', in Software Engineering Research and Practice, pp. 134-140, (2009).
[35]
H. Xu and Y. Cheng, 'Model checking bidding behaviors in internet concurrent auctions.', Computer System Science & Engineering, 22(4), (2007).
- Abstraction-based verification of infinite-state reactive modules
Recommendations
Infinite-state invariant checking with IC3 and predicate abstraction
We address the problem of verifying invariant properties on infinite-state systems. We present a novel approach, IC3ia, for generalizing the IC3 invariant checking algorithm from finite-state to infinite-state transition systems, expressed over some ...
Comments
Information & Contributors
Information
Published In
August 2016
1860 pages
ISBN:9781614996712
Sponsors
- ETINN: Essence ITN Network
- Vrije Universiteit Amsterdam: Vrije Universiteit Amsterdam, Netherlands
- PricewaterhouseCoopers: PricewaterhouseCoopers
- TANDFGROUP: Taylor & Francis Group
Publisher
IOS Press
Netherlands
Publication History
Published: 29 August 2016
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 44Total Downloads
- Downloads (Last 12 months)20
- Downloads (Last 6 weeks)3
Reflects downloads up to 26 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in