Branching in Well-Structured Transition Systems (Invited Talk) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Branching in Well-Structured Transition Systems (Invited Talk)

Résumé

The framework of well-structured transition systems has been highly successful in providing generic algorithms to show the decidability of verification problems for infinite-state systems. In some of these applications, the executions in the system at hand are actually trees, and need to be “lifted” to executions over sets of configurations in order to fit in the framework. The downside of this approach is that we might lose precision when analysing the computational complexity of the algorithms, compared to reasoning over branching executions.
Fichier non déposé

Dates et versions

hal-03439623 , version 1 (22-11-2021)

Licence

Paternité

Identifiants

Citer

Sylvain Schmitz. Branching in Well-Structured Transition Systems (Invited Talk). 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021, Ljubljana, Slovenia. pp.3:1--3:3, ⟨10.4230/LIPIcs.CSL.2021.3⟩. ⟨hal-03439623⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More