An O(n 1.5) algorithm to decide boundedness for conflict-free vector replacement systems

Journal article

Peer reviewed

Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen and R. Rodney Howell

Information processing letters, Vol.25(1), pp.27-33

1987

Abstract

Boundedness problem

complexity

conflict-free

Petri net

vector addition system

vector replacement system

6 Record Views

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.47 Software Engineering; 4.47.408 Model Checking
Web Of Science research areas: Computer Science, Information Systems
ESI research areas: Computer Science

This output has contributed to the advancement of the following goals:

Source: InCites

Title: An O(n 1.5) algorithm to decide boundedness for conflict-free vector replacement systems
Creators: Rodney R. Howell - The University of Texas at Austin
Louis E. Rosier - The University of Texas at Austin
Hsu-Chun Yen - The University of Texas at Austin
R. Rodney Howell - UMMG Department of Pediatrics
Publication Details: Information processing letters, Vol.25(1), pp.27-33
Publisher: Elsevier B.V
Academic Unit: Miller School of Medicine; Miller School of Medicine Administration; UMMG Department of Pediatrics
Language: English
Resource Type: Journal article
Record Identifier: 991031740017802976