Media type: Book Title: A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets Contributor: Esparza, Javier [Author] imprint: Hildesheim: Univ., 1991 Published in: Hildesheimer Informatik-Berichte ; 91,9 Extent: 9 Bl; graph. Darst Language: English RVK notation: SS 4615 : Hildesheimer Informatik-Berichte Origination: Footnote:
Departmental Library DrePunct – stack Shelf-mark: 0892 40567 001 Item ID: 10013337 Status: Loanable, place order > Ordering possible ‒ please log in Delivery expected: 1 - 2 days after order