Decidable problems on the strong connectivity of Petri net reachability sets
type: Item
instance of: scholarly article
title: Decidable problems on the strong connectivity of Petri net reachability sets
zbMATH Open document ID: 0362.68095
DOI: 10.1016/0304-3975(77)90059-7
author: Toshiro Araki
author: Tadao Kasami
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U20
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3564351
MaRDI profile type: Publication
full work available at URL: 0304-3975(77)90059-7
OpenAlex ID: W2027710994
cites work: Some decision problems related to the reachability problem for Petri nets
cites work: Q5576254
cites work: Semigroups, Presburger formulas, and languages
cites work: The equality problem for vector addition systems is undecidable
cites work: Parallel program schemata
cites work: On Context-Free Languages
cites work: Q4051601
description: scientific article; zbMATH DE number 3564351