The decidability of persistence for vector addition systems (Q1144929): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Decidable problems on the strong connectivity of Petri net reachability sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A decidability theorem for a class of vector-addition systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3893319 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Synchronisationsgraphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semigroups, Presburger formulas, and languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel program schemata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3939247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853141 / rank | |||
Normal rank |
Latest revision as of 09:27, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The decidability of persistence for vector addition systems |
scientific article |
Statements
The decidability of persistence for vector addition systems (English)
0 references
1980
0 references
vector addition systems
0 references
Petri net
0 references
reachability problem
0 references
persistence
0 references
Presburger arithmetic
0 references