No. Title Author Year
1 When is Containment Decidable for Probabilistic Automata? Daviaud, Laure et al. 2018
2 Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One Figueira, Diego et al. 2017
3 A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One Göller, Stefan et al. 2016
4 The Covering and Boundedness Problems for Branching Vector Addition Systems Demri, Stéphane et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI