On the Reachability Problem for 5-Dimensional Vector Addition Systems
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1976-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-280
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report