3 citations · 3 across the 2 of their papers we have counts for
5 papers
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…
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…