An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems
- 1 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1) , 27-33
- https://doi.org/10.1016/0020-0190(87)90089-5
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A multiparameter analysis of the boundedness problem for vector addition systemsJournal of Computer and System Sciences, 1986
- Complexity of the word problem for commutative semigroups of fixed dimensionActa Informatica, 1985
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- The covering and boundedness problems for vector addition systemsTheoretical Computer Science, 1978
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Parallel program schemataJournal of Computer and System Sciences, 1969