DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59556958, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4251918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4785460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimilarity for one-counter processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation-like equivalences with finite-state processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation preorder over simple process algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown processes: Games and model-checking / rank
 
Normal rank

Latest revision as of 16:23, 7 June 2024

scientific article
Language Label Description Also known as
English
DP lower bounds for equivalence-checking and model-checking of one-counter automata
scientific article

    Statements

    DP lower bounds for equivalence-checking and model-checking of one-counter automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2004
    0 references
    One-counter machines
    0 references
    Equivalence-checking
    0 references
    Model-checking
    0 references

    Identifiers