The Parametric Complexity of Lossy Counter Machines (Q5092331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
The Parametric Complexity of Lossy Counter Machines
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ICALP.2019.129 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizing well quasi-orders and bounding the length of bad sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150203 / 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: Ordinal recursive bounds for Higman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite containment problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Freeze LTL with Ordered Attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future-Looking Logics on Data Words and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: History-Register Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Priority Channel Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Senescent ground tree rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace inclusion for one-counter nets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametric Ordinal-Recursive Complexity of Post Embedding Problems / 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: Zeno, Hercules, and the Hydra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonelementary Complexities for Branching VASS, MELL, and Extensions / 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: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems in unreliable computations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and large finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursive complexity of unordered data nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / 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: The Power of Well-Structured Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Counter Machines Decidability Cheat Sheet / 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: Proofs and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision procedures in relevance logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for some finite forms of Kruskal's theorem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://hal.archives-ouvertes.fr/hal-02020728 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2918439752 / rank
 
Normal rank
Property / title
 
The Parametric Complexity of Lossy Counter Machines (English)
Property / title: The Parametric Complexity of Lossy Counter Machines (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ICALP.2019.129 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561622
Language Label Description Also known as
English
The Parametric Complexity of Lossy Counter Machines
scientific article; zbMATH DE number 7561622

    Statements

    0 references
    21 July 2022
    0 references
    counter machine
    0 references
    well-structured system
    0 references
    well-quasi-order
    0 references
    antichain
    0 references
    fast-growing complexity
    0 references
    0 references
    0 references
    The Parametric Complexity of Lossy Counter Machines (English)
    0 references

    Identifiers