Forward analysis and model checking for trace bounded WSTS (Q290914): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.04.020 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FAST / 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.tcs.2016.04.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2337536205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Algol-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis for WSTS, Part II: Complete WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: From pre-historic to post-modern symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expand, enlarge and check: new algorithms for the coverability problem of WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / 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: Model-checking CTL* over flat Presburger counter systems / 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: Interprocedural Reachability for Flat Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Semilinear Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Lossy and Perfect Fifo Channels / 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: Undecidable verification problems for programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems in unreliable computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using forward reachability analysis for verification of lossy channel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of model checking for infinite-state concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the decision of reachability for register machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-structured framework for analysing Petri net extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Counter Machines Decidability Cheat Sheet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / 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: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / 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: Q4247290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable fixpoints in well-structured symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational and recognizable complex trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded underapproximations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.04.020 / rank
 
Normal rank

Latest revision as of 13:31, 9 December 2024

scientific article
Language Label Description Also known as
English
Forward analysis and model checking for trace bounded WSTS
scientific article

    Statements

    Forward analysis and model checking for trace bounded WSTS (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2016
    0 references
    complete WSTS
    0 references
    model checking
    0 references
    flattable system
    0 references
    bounded language
    0 references
    acceleration
    0 references
    0 references
    0 references
    0 references
    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