Vers des outils efficaces pour la vérification de systèmes concurrents

Abstract : The goal of this thesis is to solve in practice the coverability problem in Petri nets and lossy channel systems (LCS). These systems are interesting to study because they can be used to model concurrent and distributed systems. The coverability problem in a transition system is to decide whether it is possible, from an initial state, to reach a greater state than a target state. In the first part, we discuss how to solve this problem for well-structured transition systems (WSTS). Petri nets and LCS are WSTS. In the first part, we present a general method to solve this problem quickly in practice. This method uses coverability invariants, which are over-approximations of the set of coverable states. The second part studies Petri nets.We present comparisons of coverability invariants, both in theory and in practice. A particular attention will be paid on the combination of the classical state inequation and a simple sign analysis. LCS are the focus of the third part. We present a variant of the state inequation for LCS and two invariants that compute properties for the order in which messages are sent. Two tools, ICover and BML, were developed to solve the coverability problem in Petri nets and LCS respectively.
Document type :
Theses
Complete list of metadatas

Cited literature [101 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01827245
Contributor : Abes Star <>
Submitted on : Monday, July 2, 2018 - 1:08:08 AM
Last modification on : Tuesday, July 3, 2018 - 1:08:34 AM
Long-term archiving on : Monday, October 1, 2018 - 7:35:37 AM

File

GEFFROY_THOMAS_2017.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01827245, version 1

Collections

Citation

Thomas Geffroy. Vers des outils efficaces pour la vérification de systèmes concurrents. Autre [cs.OH]. Université de Bordeaux, 2017. Français. ⟨NNT : 2017BORD0848⟩. ⟨tel-01827245⟩

Share

Metrics

Record views

111

Files downloads

50