Computational techniques for reachability analysis of Max-Plus-Linear systems (Q2409446): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: opaal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VeriSIMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ellipsoidal Toolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.automatica.2015.01.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974274514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Abstractions of Max-Plus-Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational techniques for reachability analysis of Max-Plus-Linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Min and Max Invariants Using Max-Plus Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / 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: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for the Design of Real-Time Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transience Bounds for Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational techniques for hybrid system verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ultimate behaviour of the sequence of consecutive powers of a matrix in the max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minkowski theorem for max-plus convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4909604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transience Bounds for Long Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of hybrid dynamical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5200628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation of job-shop systems using timed event-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Hybrid Systems Using Support Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis for timed automata using max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Forward and Backward Reachability as Tools for Safety Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear regulation: The piecewise linear approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140769 / rank
 
Normal rank

Latest revision as of 12:39, 14 July 2024

scientific article
Language Label Description Also known as
English
Computational techniques for reachability analysis of Max-Plus-Linear systems
scientific article

    Statements

    Computational techniques for reachability analysis of Max-Plus-Linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 October 2017
    0 references
    max-plus-linear systems
    0 references
    forward and backward reachability analysis
    0 references
    reach tube and reach set
    0 references
    piecewise affine systems
    0 references
    difference-bound matrices
    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