Handling infinitely branching well-structured transition systems (Q1686118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2017.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767753763 / 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: Well-structured transition systems everywhere! / 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: On the Decidability Status of Reachability and Coverability in Graph Transformation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Structured Graph Transformation Systems with Negative Application Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis of Depth-Bounded Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal Abstractions for Well-Structured Transition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Coverability Analysis by Proof Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389997 / 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: Expand, enlarge and check: new algorithms for the coverability problem of WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Well-Structured Systems / 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: Multiply-Recursive Upper Bounds with Higman’s Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable channels are easier to verify than perfect channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On termination and invariance for faulty channel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ω-Petri Nets / 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: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Languages Piecewise Testable in the Strict Sense / 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: On families of mutually exclusive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of relations. Transl. from the French by P. Clote / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on well quasi-orderings for powersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial well‐ordering of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ideal view on Rackoff's coverability technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coverability in ν-Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverability Trees for Petri Nets with Unordered Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Piecewise Testable Separability for Regular Tree Languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:56, 14 July 2024

scientific article
Language Label Description Also known as
English
Handling infinitely branching well-structured transition systems
scientific article

    Statements

    Handling infinitely branching well-structured transition systems (English)
    0 references
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    well-structured transition systems
    0 references
    infinite branching
    0 references
    completion
    0 references
    decidability
    0 references
    coverability
    0 references
    termination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers