Computational techniques for reachability analysis of Max-Plus-Linear systems

DOI10.1016/j.automatica.2015.01.002zbMath1371.93035OpenAlexW1974274514WikidataQ107155738 ScholiaQ107155738MaRDI QIDQ2409446

Alessandro Abate, Dieky Adzkiya, Bart De Schutter

Publication date: 11 October 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2015.01.002

zbMATH Keywords

piecewise affine systemsmax-plus-linear systemsdifference-bound matricesforward and backward reachability analysisreach tube and reach set

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03) Max-plus and related algebras (15A80)

Related Items (10)

Analysis and control of max-plus linear discrete-event systems: an introduction ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ Local and global robustness with \(q\)-step delay for max-plus linear systems ⋮ Modeling and analysis of switching max-plus linear systems with discrete-event feedback ⋮ Relatively maximal perturbation bounds for global robustness of max‐plus linear systems ⋮ Properties of morphological dilation in max-plus and plus-prod algebra in connection with the Fourier transformation ⋮ Global optimization for max-plus linear systems and applications in distributed systems ⋮ Sparsity in max-plus algebra and systems ⋮ Conditional reachability of uncertain max plus linear systems ⋮ \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems

Uses Software

• MPT
• Ellipsoidal Toolbox
• opaal
• VeriSIMPL
• Algorithm 97

Cites Work

• Reachability analysis for timed automata using max-plus algebra
• The Minkowski theorem for max-plus convex sets
• A theory of timed automata
• On the ultimate behaviour of the sequence of consecutive powers of a matrix in the max-plus algebra
• Scheduling with timed automata
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• Computational techniques for reachability analysis of Max-Plus-Linear systems
• Transience Bounds for Long Walks
• Transience Bounds for Distributed Algorithms
• On a routing problem
• Inferring Min and Max Invariants Using Max-Plus Polyhedra
• Comparing Forward and Backward Reachability as Tools for Safety Analysis
• Reachability Analysis of Hybrid Systems Using Support Functions
• Performance evaluation of job-shop systems using timed event-graphs
• Nonlinear regulation: The piecewise linear approach
• Computational techniques for hybrid system verification
• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems
• Hybrid Systems: Computation and Control
• Finite Abstractions of Max-Plus-Linear Systems
• REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
• Formal Methods for the Design of Real-Time Systems
• Hybrid Systems: Computation and Control
• Equivalence of hybrid dynamical models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational techniques for reachability analysis of Max-Plus-Linear systems