Backward Reachability of Autonomous Max-Plus-Linear Systems
نویسندگان
چکیده
This work discusses the backward reachability of autonomous Max-Plus-Linear (MPL) systems, a class of continuous-space discrete-event models that are relevant for applications dealing with synchronization and scheduling. Given an MPL system and a continuous set of final states, we characterize and compute its “backward reach tube” and “backward reach sets,” namely the set of states that can reach the final set within a given event interval or at a fixed event step, respectively. We show that, in both cases, the computation can be done exactly via manipulations of difference-bound matrices. Furthermore, we illustrate the application of the backward reachability computations over safety and transient analysis of MPL systems.
منابع مشابه
Finite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms
ion function f , i.e. f−1(ŝ) = {s : f (s) = ŝ}. Recall that f−1(ŝ) is a block (or in fact a DBM) and the dynamics in each block are affine. If there exists a transition from an outgoing state s to an incoming state s′ in the concrete transition system, i.e. s γ −−→ s′, then there is a transition from f (s) to f (s′) in the abstract transition system, i.e. f (s) γ −−→ f f (s′) [23, Def. 7.51]. S...
متن کاملForward Reachability Computation for Autonomous Max-Plus-Linear Systems
This work discusses the computation of forward reachability for autonomous (that is, deterministic) Max-Plus-Linear (MPL) systems, a class of continuous-space discrete-event models that are relevant for applications dealing with synchronization and scheduling. Given an MPL model and a set of initial states, we characterize and compute its “reach tube,” namely the sequential collection of the se...
متن کاملReachability and observability of linear systems over max-plus
This paper discusses the properties of reachability and observability for linear systems over the max-plus algebra. Working in the event-domain, the concept of asticity is used to develop conditions for weak reachability and weak observability. In the reachability problem, residuation is used to determine if a state is reachable and to generate the required control sequence to reach it. In the ...
متن کاملReachability analysis for timed automata using max-plus algebra
We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed to perform forward and backward reachability analysis using maxplus polyhedra. To show that the appro...
متن کاملComputationalTechniques forReachabilityAnalysis
This work discusses a computational approach to reachability analysis of Max-Plus-Linear (MPL) systems, a class of discreteevent systems widely used in synchronization and scheduling applications. Given a set of initial states, we characterize and compute its “reach tube,” namely the collection of set of reachable states (regarded step-wise as “reach sets”). By an alternative characterization o...
متن کامل