Forward Analysis and Model Checking for Trace Bounded WSTS - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2016

Forward Analysis and Model Checking for Trace Bounded WSTS

Pierre Chambart
  • Fonction : Auteur
  • PersonId : 962082

Résumé

We investigate a subclass of well-structured transition systems (WSTS), the trace bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.

Dates et versions

hal-01329871 , version 1 (09-06-2016)

Identifiants

Citer

Pierre Chambart, Alain Finkel, Sylvain Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. Theoretical Computer Science, 2016, 637, pp.1--29. ⟨10.1016/j.tcs.2016.04.020⟩. ⟨hal-01329871⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More