activity
20192023
most citedStrategic (Timed) Computation Tree Logic

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

collaborators

5 papers

cs.MA2023

Optimal Scheduling of Agents in ADTrees: Specialised Algorithm and Declarative Models

Jaime Arias, Carlos Olarte, Laure Petrucci +3

Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact th…

cs.LO2023★ 1 cited

Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving

Jaime Arias, Kyungmin Bae, Carlos Olarte +3

Parametric time Petri nets with inhibitor arcs (PITPNs) support flexibility for timed systems by allowing parameters in firing bounds. In this paper we present and prove correct a…

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.MA2021

Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

Jaime Arias, Łukasz Maśko, Wojciech Penczek +2

Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact th…

cs.CR2019

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems

Jaime Arias, Carlos E. Budde, Wojciech Penczek +2

Attack-Defence Trees (ADTs) are well-suited to assess possible attacks to systems and the efficiency of counter-measures. In this paper, we first enrich the available constructs wi…