The Complexity of Reversal-Bounded Model-Checking (Q3172883): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W80793323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A really temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Reversal-Bounded Model-Checking / 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: Q4474213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Counter Machines Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision problems for finite-turn multicounter machines / 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: Q4536602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and verification problems. / 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: TaPAS: The Talence Presburger Arithmetic Suite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEXP TIME-complete description logics with concrete domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / 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: Verification Decidability of Presburger Array Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about infinite computations / rank
 
Normal rank

Latest revision as of 11:39, 4 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Reversal-Bounded Model-Checking
scientific article

    Statements

    The Complexity of Reversal-Bounded Model-Checking (English)
    0 references
    0 references
    0 references
    7 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers