Evènement pour le groupe Séminaire Méthodes Formelles

Date 2016-04-19  11:00-12:00
TitreReachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete 
RésuméBlondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of states and polynomial in the norm of vectors. The resulting guess-and-verify algorithm is optimal (PSPACE), but only if the input vectors are given in binary. We answer positively the main question left open by their work, namely establish that reachability witnesses of pseudo-polynomial length always exist. Hence, when the input vectors are given in unary, the improved guess-and-verify algorithm requires only logarithmic space. Joint work with Matthias Englert and Patrick Totzke, available from: http://arxiv.org/abs/1602.00477 
OrateurRanko Lazic 
UrlWarwick University 

Aucun document lié à cet événement.

Retour à l'index