Well-structured transition systems everywhere! (Q5941101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Verifying programs with unreliable channels / 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: Ensuring completeness of symbolic verification methods for infinite-state systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems related to the reachability problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursivite et cônes rationnels fermés par intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing finite Kripke structures in propositional temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / 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: Deciding properties of integral relational automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992422 / 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: Fifo nets without order deadlock / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Networks of Communicating Finite State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid automata with finite bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation equivalences for a class of non-finite-state programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: On permutative grammars generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3051391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501519 / 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: Q2767047 / rank
 
Normal rank

Revision as of 18:20, 3 June 2024

scientific article; zbMATH DE number 1635266
Language Label Description Also known as
English
Well-structured transition systems everywhere!
scientific article; zbMATH DE number 1635266

    Statements

    Well-structured transition systems everywhere! (English)
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    infinite systems
    0 references
    verification
    0 references
    well-quasi-ordering
    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
    0 references
    0 references
    0 references

    Identifiers