Reconfigurable Timed Discrete-Event Systems
Matin Macktoobian

TL;DR
This paper introduces a comprehensive method for automatic reconfiguration of timed discrete-event systems, extending previous untimed solutions and demonstrating invariance between centralized and decentralized approaches.
Contribution
It provides the first general solution to reconfiguration in timed discrete-event systems and shows the equivalence of centralized and decentralized solutions.
Findings
First general solution for timed reconfiguration
Invariance between centralized and decentralized solutions
Extension of recursive backtracking approach
Abstract
In this paper, we present the first general solution to the automatic reconfiguration problem of timed discrete-event systems. We extend the recursive forcible backtracking approach which had been already solved the automatic reconfiguration problem of untimed discrete-event systems. In particular, we first solve the timed centralized reconfiguration problem using a specific timed eligibility set. Then, we study the identity between the solutions to an arbitrary timed centralized reconfiguration problem and its corresponding decentralized version. It turns out that the solutions to both cases are identical to each other. So, the solution obtained by the proposed theory is interestingly invariant to systematic distributions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
