On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.09.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A survey of computational complexity results in systems and control / 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: Algorithmic analysis of polygonal hybrid systems. I: Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is a pair of matrices mortal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with low-dimensional dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding stability and mortality of piecewise affine dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low dimensional hybrid systems -- decidable, undecidable, don't know / 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: REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems Forming Strange Billiards / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mortality problem for matrices of low dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updatable timed automata / 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: Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic analysis of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Two-Clock Timed Automata Is PSPACE-Complete / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.09.003 / rank
 
Normal rank

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
On the decidability and complexity of problems for restricted hierarchical hybrid systems
scientific article

    Statements

    On the decidability and complexity of problems for restricted hierarchical hybrid systems (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2016
    0 references
    hybrid systems
    0 references
    reachability
    0 references
    mortality
    0 references
    piecewise affine maps
    0 references
    (hierarchical) piecewise constant derivatives
    0 references

    Identifiers