5 citations · 10 across the 11 of their papers we have counts for
11 papers
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…
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…
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…
Efficient Convex Zone Merging in Parametric Timed Automata
Étienne André, Dylan Marinho, Laure Petrucci +1
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. Reducing their state space is a signifi…
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…
Modular Analysis of Tree-Topology Models
Laure Petrucci, Michał Knapik
We investigate networks of automata that synchronise over common action labels. A graph synchronisation topology between the automata is defined in such a way that two automata are…
Parametric Verification: An Introduction
Étienne André, Michał Knapik, Didier Lime +2
This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in T…
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…
Quasi-Optimal Partial Order Reduction
Huyen T. T Nguyen, César Rodríguez, Marcelo Sousa +2
A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduc…
Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm
Camille Coti, Charles Lakos, Laure Petrucci
This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes…
Proceedings 2nd French Singaporean Workshop on Formal Methods and Applications
Shang-Wei Lin, Laure Petrucci
This volume contains the proceedings of the 2nd French Singaporean Workshop on Formal Methods and Applications (FSFMA'14). The workshop was held in Singapore on May 13th, 2014, as…