Dieky Adzkiya

Learn More
This work puts forward a novel technique to generate finite abstractions of autonomous and nonautonomous Max-PlusLinear (MPL) models, a class of discrete-event systems used to characterize the dynamics of the timing related to successive events that synchronize autonomously. Nonautonomous versions of MPL models embed within their dynamics nondeterminism,(More)
ion and Verification of Autonomous Max-Plus-Linear Systems Dieky Adzkiya, Bart De Schutter, and Alessandro Abate Abstract—This work investigates the use of finite abstractions for the verification of autonomous Max-Plus-Linear (MPL) models. Abstractions are characterized as finite-state labeled transition systems (LTS) and are obtained by first partitioning(More)
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,”(More)
This work puts forward a technique to generate finite abstractions of nonautonomous Max-Plus-Linear (MPL) models, a known class of discrete-event systems characterizing the timing related to event counters. Nonautonomous models embed an external input (namely a nondeterministic choice, regarded as an exogenous control signal) in the dynamics. Abstractions(More)
This work presents a technique to generate finite abstractions of autonomous Max-Plus-Linear (MPL) systems, a class of discrete-event systems employed to characterize the dynamics of the timing related to the synchronization of successive events. Abstractions of MPL systems are derived as finite-state transition systems. A transition system is obtained(More)
This work investigates the use of finite abstractions to study the finite-horizon probabilistic invariance problem over Stochastic MaxPlus-Linear (SMPL) systems. SMPL systems are probabilistic extensions of discrete-event MPL systems that are widely employed in the engineering practice for timing and synchronisation studies. We construct finite abstractions(More)
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,”(More)