Abstract: Embodiments of the present invention disclose an approach for managing a plurality of heterogeneous automation scripts with dynamic environment preparation. Specifically, the approach involves allowing users to upload a script to a centralized script manager. The uploaded script is then analyzed to determine the necessary runtime environment and library resources required for successful execution. After resolving the dependencies of the script, an optimal machine on a centralized server is selected for automation. The chosen machine is equipped with the required runtime environment and library resources, which are automatically installed.

Abstract: A method of controlling a transition aircraft having actuators and which transitions between a first take-off/landing regime and a second horizontal flight regime, including: controlling a first actuator subset in the first regime and a second actuator subset in the second regime using the flight controller, by: a) providing measurements or estimates of flight parameters; b) depending on a current regime, checking whether a predefined set of conditions for that regime are fulfilled, by comparing flight parameters with threshold values; c) if conditions are fulfilled, signalling a decision-maker and awaiting confirmation regarding a transition to the other regime; d) instructing the flight controller to make the transition if approved; e) after transitioning in step d), commanding the aircraft according to the other regime; and f) returning to step a). Step e) includes gradually blending in a control law for the other regime over time while blending out the current regime.

Abstract: The present disclosure relates to a method for use in the formal verification of an electronic circuit. Embodiments may include receiving, using a processor, a portion of an electronic circuit design and analyzing a syntactic structure of a string associated with the electronic circuit design. Embodiments may also include generating a parse tree, based upon, at least in part, the analysis and traversing the parse tree to identify one or more conditional nodes. Embodiments may further include generating a new node for each of the one or more conditional nodes and displaying, at a graphical user interface, a check, at least one of the one or more conditional nodes or the new node prior to performing either register-transfer-level RTL synthesis or final synthesis.