activity
20202026
most citedStrategic (Timed) Computation Tree Logic

1 citations · 2 across the 9 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2026

Towards Probabilistic Strategic Timed CTL

Wojciech Jamroga, Marta Kwiatkowska, Wojciech Penczek +2

We define PSTCTL, a probabilistic variant of Strategic Timed CTL (STCTL), interpreted over stochastic multi-agent systems with continuous time and asynchronous execution semantics.…

cs.LO2026

IMITATOR4AMAS: Strategy Synthesis for STCTL

Davide Catta, Adrien Lacroix, Wojciech Penczek +2

IMITATOR4AMAS supports model checking and synthesis of memoryless imperfect information strategies for STCTL, interpreted over networks of parametric timed automata with asynchrono…

cs.LO2025

Formal Verification of Probabilistic Multi-Agent Systems for Ballistic Rocket Flight Using Probabilistic Alternating-Time Temporal Logic

Damian Kurpiewski, Jędrzej Michalczyk, Wojciech Jamroga +2

This technical report presents a comprehensive formal verification approach for probabilistic agent systems modeling ballistic rocket flight trajectories using Probabilistic Altern…

cs.LO2023★ 1 cited

Strategic (Timed) Computation Tree Logic

Jaime Arias, Wojciech Jamroga, Wojciech Penczek +2

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 synchron…

cs.LO2020

Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them

Wojciech Jamroga, Wojciech Penczek, Teofil Sidoruk

Recently, we have proposed a framework for verification of agents' abilities in asynchronous multi-agent systems, together with an algorithm for automated reduction of models. The…