On selective unboundedness of VASS (Q355513): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963878989 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.0217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON YEN'S PATH LOGIC FOR PETRI NETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Yen’s Path Logic for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Coverability Graphs of Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of LTL for Vector Addition Systems with One Zero-Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reachability Problem for Vector Addition System with One Zero-Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Acceleration of Ultimately Periodic Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming Past LTL and Flat Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and covering of infinite reachability trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Counter Machines Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP-complete number-theoretic problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reachability problem for 5-dimensional vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and verification problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / 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: Vector addition system reachability problem / 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: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small vertex cover makes Petri net coverability and boundedness easier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Petri nets. 1: Basic models. Advances in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiparameter analysis of the boundedness problem for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The residue of vector sets with applications to decidability problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for deciding the existence of certain petri net paths / rank
 
Normal rank

Latest revision as of 15:43, 6 July 2024

scientific article
Language Label Description Also known as
English
On selective unboundedness of VASS
scientific article

    Statements

    On selective unboundedness of VASS (English)
    0 references
    24 July 2013
    0 references
    vector addition systems with states
    0 references
    place boundedness problem
    0 references
    regularity detection problem
    0 references
    exponential space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers