The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2010.06.008 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6018469 / rank
 
Normal rank
Property / zbMATH Keywords
 
program correctness
Property / zbMATH Keywords: program correctness / rank
 
Normal rank
Property / zbMATH Keywords
 
theory of computation
Property / zbMATH Keywords: theory of computation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108820019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure to decide reachability in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2920125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2010.06.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:41, 9 December 2024

scientific article
Language Label Description Also known as
English
The reachability problem for branching vector addition systems requires doubly-exponential space
scientific article

    Statements

    The reachability problem for branching vector addition systems requires doubly-exponential space (English)
    0 references
    0 references
    27 March 2012
    0 references
    program correctness
    0 references
    theory of computation
    0 references

    Identifiers