Formal control of cyber-physical systems allows for synthesis of control strategies from rich specifications such as temporal logics. However, the classes of systems that the formal approaches can be applied to is limited due to the computational complexity. Furthermore, the synthesis problem becomes even harder when non-determinism or stochasticity is considered. In this work, we propose an alternative approach. First, we mark the unwanted events on the traces of the system and generate a controllable cause representing these events as a Signal Temporal Logic (STL) formula. Then, we synthesize a controller based on this formula to avoid the satisfaction of it. Our approach is applicable to any system with finitely many control choices. While we can not guarantee correctness we show on an example that the proposed approach reduces the number of the unwanted events. In particular, we validate it for the congestion avoidance problem in a traffic network.
In this paper, we contribute to the study of topological partition relations for pairs of countable ordinals and prove that, for all integers n ≥ 3,where R cl (•, •) and R(•, •) denote the closed Ramsey numbers and the classical Ramsey numbers, respectively. We also establish the following asymptotically weaker upper bound:eliminating the use of Ramsey numbers. These results improve the previously known upper and lower bounds.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.