Branch-well-structured transition systems and extensions (Q2165211): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling Infinitely Branching WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5367063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5028474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding branching time properties for asynchronous programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition calculus in set theory / 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: A well-structured framework for analysing Petri net extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5129947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for unboundedness of fifo channels / rank
 
Normal rank

Latest revision as of 21:46, 29 July 2024

scientific article
Language Label Description Also known as
English
Branch-well-structured transition systems and extensions
scientific article

    Statements

    Branch-well-structured transition systems and extensions (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2022
    0 references
    verification
    0 references
    decidability
    0 references
    coverability
    0 references
    termination
    0 references
    well-quasi-ordering
    0 references

    Identifiers