Separability of Reachability Sets of Vector Addition Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Separability of Reachability Sets of Vector Addition Systems

Résumé

Given two families of sets F and G, the F-separability problem for G asks whether for two given sets U, V ∈ G there exists a set S ∈ F, such that U is included in S and V is disjoint with S. We consider two families of sets F: modular sets S ⊆ N d , defined as unions of equivalence classes modulo some natural number n ∈ N, and unary sets, which extend modular sets by requiring equality below a threshold n, and equivalence modulo n above n. Our main result is decidability of modular and unary separability for the class G of reachability sets of Vector Addition Systems,
Fichier principal
Vignette du fichier
LIPIcs-STACS-2017-24.pdf (511.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01587619 , version 1 (14-09-2017)

Identifiants

Citer

Lorenzo Clemente, Wojciech Czerwiński, Sławomir Lasota, Charles Paperman. Separability of Reachability Sets of Vector Addition Systems. STACS Symposium on Theoretical Aspects of Computer Science, 2017, Hannovre, Germany. ⟨10.4230/LIPIcs.STACS.2017.24⟩. ⟨hal-01587619⟩
74 Consultations
28 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More