On the complexity of bounded time and precision reachability for piecewise affine systems (Q2636516): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Olivier Bournez / rank
Normal rank
 
Property / author
 
Property / author: Olivier Bournez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2529633050 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.05353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Complexity of Bounded Time Reachability for Piecewise Affine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Problems for Hierarchical Piecewise Constant Derivative Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability of saturated linear dynamical systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's decidable about hybrid automata? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing over the reals with addition and order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with low-dimensional dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized shifts: unpredictability and undecidability in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:23, 15 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of bounded time and precision reachability for piecewise affine systems
scientific article

    Statements

    On the complexity of bounded time and precision reachability for piecewise affine systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2018
    0 references
    complexity
    0 references
    reachability
    0 references
    piecewise affine systems
    0 references

    Identifiers