BIROn - Birkbeck Institutional Research Online

    The covering and boundedness problems for branching vector addition systems

    Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2009) The covering and boundedness problems for branching vector addition systems. In: Kannan, R. and Kumar, K.N. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics 4. Dagstuhl, Germany: Schloss Dagstuhl, pp. 181-192. ISBN 9783939897132.

    Full text not available from this repository.

    Abstract

    The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.

    Metadata

    Item Type: Book Section
    Keyword(s) / Subject(s): vector addition systems, petri nets, covering, boundedness, computational complexity
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 30 May 2013 15:31
    Last Modified: 11 Oct 2016 12:01
    URI: http://eprints.bbk.ac.uk/id/eprint/7133

    Statistics

    Downloads
    Activity Overview
    0Downloads
    108Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item