Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets

Toshiro Araki, Tadao Kasami. Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. Theoretical Computer Science, 4(1):99-119, 1977.

Abstract

Abstract is missing.