Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6102
Title: On the Reachability Problem for 5-Dimensional Vector Addition Systems
Authors: Hopcroft, John E.
Pansiot, J.
Keywords: computer science
technical report
Issue Date: Jun-1976
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-280
Abstract: The reachability set for vector addition systems of dimension less than or equal to five are shown to be effectively computable semilinear sets. Thus reachability, equvalence and containment are decidable up to dimension 5. An example of a non-semilinear reachability set is given for dimension 6. Keywords and phrases: Vector addition system, Petri net, semilinear set, algorithms, decidability.
URI: http://hdl.handle.net/1813/6102
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
76-280.pdf1.73 MBAdobe PDFView/Open
76-280.ps707.8 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us