Publications

Dissecting ltlsynt

Florian Renkin · Philipp Schlehuber-Caissier · Alexandre Duret-Lutz · Adrien Pommellet

ltlsynt is a tool for synthesizing a reactive circuit satisfying a specification expressed as an LTL formula. ltlsynt generally follows a textbook approach: the LTL specification is translated into a parity game whose winning strategy can be seen as a Mealy machine modeling a valid controller. This article details each step of this approach, and presents various refinements integrated over the years. Some of these refinements are unique to ltlsynt: for instance, ltlsynt supports multiple ways to encode a Mealy machine as an AIG circuit, features multiple simplification algorithms for the intermediate Mealy machine, and bypasses the usual game-theoretic approach for some subclasses of LTL formulas in favor of more direct constructions.

The Mealy-machine reduction functions of Spot

Florian Renkin · Philipp Schlehuber-Caissier · Alexandre Duret-Lutz · Adrien Pommellet

We present functions for reducing Mealy machines, initially detailed in our FORTE’22 article. These functions are now integrated into Spot 2.11.2, where they are used as part of the ltlsynt tool for reactive synthesis. Of course, since Spot is a library, these functions can also be used on their own, and we provide Python bindings for easy experiments. The reproducible capsule benchmarks these functions on Mealy machines from various sources, and compare them to the MeMin tool.

A benchmark of nested named entity recognition approaches in historical structured documents

Solenn Tual · Nathalie Abadie · Joseph Chazalon · Bertrand Duménieu · Edwin Carlinet

Named Entity Recognition (NER) is a key step in the creation of structured data from digitised historical documents. Traditional NER approaches deal with flat named entities, whereas entities are often nested. For example, a postal address might contain a street name and a number. This work compares three nested NER approaches, including two state-of-the-art approaches using Transformer-based architectures. We introduce a new Transformer-based approach based on joint labelling and semantic weighting of errors, evaluated on a collection of 19th-century Paris trade directories. We evaluate approaches regarding the impact of supervised fine-tuning, unsupervised pre-training with noisy texts, and variation of IOB tagging formats. Our results show that while nested NER approaches enable extracting structured data directly, they do not benefit from the extra knowledge provided during training and reach a performance similar to the base approach on flat entities. Even though all 3 approaches perform well in terms of F1-scores, joint labelling is most suitable for hierarchically structured data. Finally, our experiments reveal the superiority of the IO tagging format on such data.

On the historical evolution of the performance versus cost ratio of Raspberry Pi computers

David Beserra · Nidà Meddouri · Célia Restes · Anys Nait Zerrad · Basma Bouharicha · Aurore Duvernoy

This article aims to analyze the historical evolution of the cost/performance ratio of the Raspberry Pi family of computers, given their representativeness in the field of single-board computers. While comparing the cost/performance ratio of different models of single-board computers is not a new idea, there are no studies focused on evaluating the performance evolution and associated costs of all generations of the Raspberry Pi B line. Our analysis considered all generations of Raspberry Pi B line available on the market until 2023, and we adjusted computer prices based on the 2012 dollar value, the year of the first Raspberry Pi’s launch. The results indicate a clear trend of increasing performance over time, accompanied by a tendency for the price paid for performance to decrease. This reduction becomes even more pronounced when considering the depreciation of the dollar compared to its value in 2012.

Des joueurs sous écrou : Jeux d’argent, carrière déviante et criminalité dans la population carcérale française

Aymeric Brody

La pratique des jeux d’argent est sans doute l’activité ludique la plus contrôlée qui soit, notamment parce qu’elle est associée à des problèmes d’addiction, de délinquance et de criminalité. En effet, si le développement actuel des jeux d’argent contribue à la banalisation de cette pratique, elle n’en demeure pas moins considérée comme potentiellement néfaste voire condamnable, au point de conduire directement ou indirectement certains joueurs en prison. L’enquête de terrain que nous avons menée avec les populations carcérales de deux établissements pénitentiaires franais, permet d’abord de relativiser la place que le jeu occupe dans la trajectoire biographique des joueurs détenus, celui-ci étant le plus souvent peru comme une activité récréative et socialisatrice (y compris en détention). En revanche, une proportion non négligeable d’entre eux considèrent que cette pratique a déjà provoqué dans leur vie des probl èmes d’addiction et que ces probl èmes ont un lien direct ou indirect avec le motif de leur incarcération. Grâce aux entretiens réalisés avec ces derniers, nous découvrirons comment ce lien se noue et se dénoue dans la construction de leur récit de vie en tant que joueurs, tout en cherchant à saisir les conditions d’entrée dans ce type de carrière déviante.

Security threats, countermeasures, and challenges of digital supply chains

Badis Hammi · Sherali Zeadally · Jamel Nebhen

The rapid growth of Information Communication Technologies (ICT) has impacted many fields. In this context, the supply chain has also quickly evolved toward the digital supply chain where digital and electronic technologies have been integrated into every aspect of its end-to-end process. This evolution provides numerous beneits such as proit maximization, loss reduction, and the optimization of supply chain lead times. However, the use of such technologies has also considerably opened up various security threats and risks which have widened the attack surface on the entire end-to-end supply chain. We present a holistic survey on supply chain security. We discuss the different security issues and attacks that target the diferent supply chain technologies. Then, we discuss various countermeasures and security solutions proposed by academic and industry researchers to mitigate the identiied threats. Finally, we provide some recommendations and best practices that can be adopted to achieve a secure supply chain.

Structural and spectral analysis of dynamic graphs for attack detection

Majed Jaber · Nicolas Boutry · Pierre Parrend

Cybersecurity
anomaly detection
spectral graph analysis
Laplacian spectrum
graph topology

At this time, cyberattacks represent a constant threat. Many approaches exist for detecting suspicious behaviors, but very few of them seem to benefit from the huge potential of mathematical approaches like spectral graph analysis, known to be able to extract topological features of a graph using its Laplacian spectrum. For this reason, we consider our network as a dynamic graph composed of nodes (representing the devices) and of edges (representing the requests), and we compute its Laplacian spectrum across time. An important change of topology inducing an important change in the spectrum, this spectrum seems to be the key to detect threats. Dynamic spectrum-based metrics have been developed for this aim.

Création d’un graphe de connaissances géohistorique à partir d’annuaires du commerce parisien du 19 ème siècle: Application aux métiers de la photographie

Solenn Tual · Nathalie Abadie · Bertrand Duménieu · Joseph Chazalon · Edwin Carlinet

named entity recognition and linking ; OCR noise ; spatio-temporal visualization ; Geohistorical knowledge graph ; Graphe de connaisssances géohistorique ; Humanités numériques ; Reconnaissance et résolution d’entités nommées ; Bruit OCR ; Visualisation spatio-temporelle Geohistorical knowledge graph

Les annuaires professionnels anciens, édités à un rythme soutenu dans de nombreuses villes européennes tout au long des XIXe et XXe si‘ecles, forment un corpus de sources unique par son volume et la possibilité qu’ils donnent de suivre les transformations urbaines à travers le prisme des activités professionnelles des habitants, de l’échelle individuelle jusqu’à celle de la ville enti‘ere. L’analyse spatiotemporelle d’un type de commerces au travers des entrées d’annuaires demande cependant un travail considérable de recensement, de transcription et de recoupement manuels. Pour pallier cette difficulté, cet article propose une approche automatique pour construire et visualiser un graphe de connaissances géohistorique des commerces figurant dans des annuaires anciens. L’approche est testée sur des annuaires du commerce parisien du XIXe si‘ecle allant de 1799 à 1908, sur le cas des métiers de la photographie.

Could the topology of virtual processors affect the performance of a BSD-family OS running in a VM?

David Beserra · Marc Espie · Jean Araujo · Léo Tomasimo · Hector Poncins · Hadrien-Samrek Lacombe · Thomas Vondracek

Virtual machines are an essential technology in distributed and pervasive systems. One of its configurable parameters is the topology of the virtual processing system, which can potentially impact its performance. In this work, we verify how different virtual processing topologies affect the performance of VMs running BSD OSes. We conclude that in some types of application the topology does not affect the VM performance, while in others it does, and that the performance impact also depends on the OS adopted by the VM.