Towards Probabilistic Strategic Timed CTL

Wojciech Jamroga, Marta Kwiatkowska, Wojciech Penczek, Laure Petrucci, Teofil Sidoruk
2/11/2026
cs.LOcs.MA

No confident code implementation found for this paper.

Abstract

We define PSTCTL, a probabilistic variant of Strategic Timed CTL (STCTL), interpreted over stochastic multi-agent systems with continuous time and asynchronous execution semantics. STCTL extends TCTL with strategic operators in the style of ATL. Moreover, we demonstrate the feasibility of verification with irP-strategies.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Verification of Robust Multi-Agent Systems

84% match2026

Strategic Abilities of Forgetful Agents in Stochastic Environments

82% match2023

Towards Assume-Guarantee Verification of Abilities in Stochastic Multi-Agent Systems

81% match2025

Multi-Agent Verification and Control with Probabilistic Model Checking

80% match2023

Expectation vs. Reality: Towards Verification of Psychological Games

79% match2024

An Agent-based Model for Competitive Agents

79% match2024

Cite this paper

@article{jamroga2026towards,
  title  = {Towards Probabilistic Strategic Timed CTL},
  author = {Wojciech Jamroga and Marta Kwiatkowska and Wojciech Penczek and Laure Petrucci and Teofil Sidoruk},
  year   = {2026},
  eprint = {2602.10824},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.10824v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.10824.svg)](https://codeofpaper.com/paper/2602.10824)

Discussion