Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets

Authors:
Paola Alimonti;Esteban Feuerstein;Umberto Nanni
Affiliations:
-;-;-
Venue:
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Year:
1992

Citing 0
Cited 3

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Linear connectivity problems in directed hypergraphs

Theoretical Computer Science
Complexity of linear connectivity problems in directed hypergraphs

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract