Strategic (Timed) Computation Tree Logic
Authors: 
Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil SidorukAuthors Info & Claims
Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, Teofil SidorukAuthors Info & ClaimsPages 382 - 390
Abstract
We define extensions of CTL and TCTL with strategic operators, called Strategic CTL (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, ie STCTL is interpreted over networks of extended Timed Automata (TA) that either make synchronous moves or synchronise via joint actions. We consider several semantics regarding information: imperfect (i) and perfect (I), and recall: imperfect (r) and perfect (R). We prove that SCTL is more expressive than ATL for all semantics, and this holds for the timed versions as well. Moreover, the model checking problem for STCTLir is of the same complexity as for ATLir, the model checking problem for STCTLir is of the same complexity as for TCTL, while for STCTLiR it is undecidable as for ATLiR. The above results suggest to use STCTLir and STCTLir in practical applications. Therefore, we use the tool IMITATOR to support model checking of STCTLir.
References
[1]
T. Ågotnes, V. Goranko, and W. Jamroga. 2007. Alternating-time Temporal Logics with Irrevocable Strategies. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK '07). ACM, New York, NY, USA, 15--24.
[2]
T. Ågotnes, V. Goranko, W. Jamroga, and M. Wooldridge. 2015. Knowledge and Ability. In Handbook of Epistemic Logic. College Publications, Rickmansworth, UK, 543--589.
[3]
R. Alur, C. Courcoubetis, and D. L. Dill. 1993. Model-Checking in Dense Real-time. Inf. Comput., Vol. 104, 1 (1993), 2--34.
[4]
R. Alur and D. L. Dill. 1990. Automata For Modeling Real-Time Systems. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming, ICALP90 (Lecture Notes in Computer Science, Vol. 443). Springer, Berlin, Germany, 322--335.
[5]
R. Alur, T.A. Henzinger, O. Kupferman, and M.Y. Vardi. 1998. Alternating Refinement Relations. In Proceedings of the 9th International Conference on Concurrency Theory, CONCUR '98 (ŁNCS, Vol. 1466). Springer, Berlin, Germany, 163--178.
[6]
R. Alur, T. A. Henzinger, and O. Kupferman. 1997. Alternating-Time Temporal Logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97). IEEE Computer Society, Palo Alto, CA, USA, 100--109.
[7]
R. Alur, T. A. Henzinger, and O. Kupferman. 2002. Alternating-Time Temporal Logic. J. ACM, Vol. 49 (2002), 672--713.
[8]
É. André, L. Fribourg, U. Kü hne, and R. Soulat. 2012. IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. In FM 2012 (Lecture Notes in Computer Science, Vol. 7436). Springer, Berlin, Germany, 33--36.
[9]
Jaime Arias, Wojciech Jamroga, Wojciech Penczek, Laure Petrucci, and Teofil Sidoruk. 2023. Strategic (Timed) Computation Tree Logic. CoRR, Vol. abs/2302.13405 (2023), 1--10.
[10]
P. Bouyer. 2009. Model-checking Timed Temporal Logics. Electronic Notes in Theoretical Computer Science, Vol. 231 (2009), 323--341.
[11]
N. Bulling, V. Goranko, and W. Jamroga. 2015. Logics for Reasoning About Strategic Abilities in Multi-Player Games. In Models of Strategic Reasoning. Logics, Games, and Communities. ŁNCS, Vol. 8972. Springer, Berlin, Germany, 93--136.
[12]
C. Dima and F.L. Tiplea. 2011. Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable. CoRR, Vol. abs/1102.4225 (2011), 1--17.
[13]
M. Faella, S. La Torre, and A. Murano. 2014. Automata-theoretic Decision of Timed Games. Theoretical Computer Science, Vol. 515 (2014), 46--63.
[14]
M. Faella, S. La Torre, and A. Murano. 2002. Dense Real-Time Games. In Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002). IEEE Computer Society, Palo Alto, CA, USA, 167--176.
[15]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. 1995. Reasoning about Knowledge. MIT Press, Cambridge, MA, USA.
[16]
V. Goranko and W. Jamroga. 2004. Comparing Semantics of Logics for Multi-agent Systems. Synthese, Vol. 139, 2 (2004), 241--280.
[17]
X. Huang and R. van der Meyden. 2014. Symbolic Model Checking Epistemic Strategy Logic. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI14). AAAI Press, Palo Alto, CA, USA, 1426--1432.
[18]
W. Jamroga. 2008. Knowledge and Strategic Ability for Model Checking: A Refined Approach. In Proceedings of the 6th German Conference on Multiagent Systems Technologies, MATES 2008 (ŁNCS, Vol. 5244). Springer, Berlin, Germany, 99--110.
[19]
W. Jamroga. 2015. Logical Methods for Specification and Verification of Multi-Agent Systems. ICS PAS Publishing House, Warsaw, Poland.
[20]
W. Jamroga and J. Dix. 2006. Model Checking ATL$_ir$ is Indeed Δ_2^P$-complete. In Proceedings of the 4th European Workshop on Multi-Agent Systems, EUMAS '06 (CEUR Workshop Proceedings, Vol. 223). CEUR-WS.org, Aachen, Germany, 13--24.
[21]
W. Jamroga, B. Konikowska, and W. Penczek. 2016. Multi-Valued Verification of Strategic Ability. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016). ACM, New York, NY, USA, 1180--1189.
[22]
W. Jamroga, W. Penczek, P. Dembinski, and A. W. Mazurkiewicz. 2018. Towards Partial Order Reductions for Strategic Ability. In Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018). IFAAMAS, Richland, SC, USA, 156--165.
[23]
W. Jamroga, W. Penczek, T. Sidoruk, P. Dembinski, and A. W. Mazurkiewicz. 2020. Towards Partial Order Reductions for Strategic Ability. JAIR, Vol. 68 (2020), 817--850.
[24]
M. Kacprzak and W. Penczek. 2004. Unbounded Model Checking for Alternating-Time Temporal Logic. In Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004). IEEE Computer Society, Palo Alto, CA, USA, 646--653.
[25]
M. Kacprzak and W. Penczek. 2005. Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic. Autonomous Agents and Multi-Agent Systems, Vol. 11, 1 (2005), 69--89.
[26]
M. Knapik, É. André, L. Petrucci, W. Jamroga, and W. Penczek. 2019. Timed ATL: Forget Memory, Just Count. Journal of Artificial Intelligence Research, Vol. 66 (2019), 197--223.
[27]
O. Kupferman, M. Y. Vardi, and P. Wolper. 2001. Module Checking. Information and Computation, Vol. 164, 2 (2001), 322--344.
[28]
F. Laroussinie, N. Markey, and G. Oreiby. 2006. Model-Checking Timed ATL for Durational Concurrent Game Structures. In Proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2006 (Lecture Notes in Computer Science, Vol. 4202). Springer, Berlin, Germany, 245--259.
[29]
A. Lomuscio, W. Penczek, and H. Qu. 2010a. Partial Order Reductions for Model Checking Temporal Epistemic Logics Over Interleaved Multi-agent Systems. In AAMAS 2010, Vol. 1--3. IFAAMAS, Richland, SC, USA, 659--666.
[30]
A. Lomuscio, W. Penczek, and H. Qu. 2010b. Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. Fundamenta Informaticae, Vol. 101, 1--2 (2010), 71--90.
[31]
A. Lomuscio, H. Qu, and F. Raimondi. 2015. MCMAS: An Open-Source Model Checker for the Verification of Multi-Agent Systems. International Journal on Software Tools for Technology Transfer, Vol. 24 (2015), 84--90.
[32]
A. Lomuscio and M. Ryan. 1997. On the Relation Between Interpreted Systems and Kripke Models. In Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. Lecture Notes in Artificial Intelligence, Vol. 1441. Springer, Berlin, Germany, 46--59.
[33]
P. Y. Schobbens. 2004. Alternating-time Logic with Imperfect Recall. In 1st International Workshop on Logic and Communication in Multi-Agent Systems (LCMAS 2003) (Electronic Notes in Theoretical Computer Science, Vol. 85). Elsevier, Amsterdam, 1--12. Issue 2.
[34]
D. Springall, T. Finkenauer, Z. Durumeric, J. Kitcat, H. Hursti, M. MacAlpine, and J. A. Halderman. 2014. Security Analysis of the Estonian Internet Voting System. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (CCS '14). ACM, New York, NY, USA, 703--715.
[35]
Y. Wang and F. Dechesne. 2009. On expressive power and class invariance. CoRR, Vol. abs/0905.4332 (2009), 1--18.
Index Terms
- Strategic (Timed) Computation Tree Logic
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Translation of Timed Promela to Timed Automata with Discrete Data
Concurrency Specification and Programming (CS&P)The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended ...
Context-free timed formalisms: Robust automata and linear temporal logics
AbstractThe paper focuses on automata and linear temporal logics for real-time pushdown reactive systems bridging tractable formalisms specialized for expressing separately dense-time real-time properties and context-free properties though ...
Comments
Information & Contributors
Information
Published In
May 2023
3131 pages
ISBN:9781450394321
- General Chairs:
- Noa Agmon,
- Bo An,
- Program Chairs:
- Alessandro Ricci,
- William Yeoh
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 30 May 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- IEA CNRS-PAN
- NCBR Poland & FNR Luxembourg
Conference
AAMAS '23
Sponsor:
AAMAS '23: International Conference on Autonomous Agents and Multiagent Systems
May 29 - June 2, 2023
London, United Kingdom
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 42Total Downloads
- Downloads (Last 12 months)19
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Feb 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