A method of multi-nomenclature production in terms technical and economic indicators was considered. An integrated design system that is able to assess the real relationship “partmachine-transport device-device-tool” proposed, arelationship between elements an automated machine tool examined. The structure system, proposed form a mixed graph, represented by sets described nonlinear equations, d...

Abstract The correctness of real-time systems depends both on the correct functionalities and realtime constraints. To go beyond existing Timed Automata based techniques, we propose a novel solution that integrates modular Hoare-style forward verifier with term rewriting system (TRS) Effects ( TimEffs ). main purposes are to: increase expressiveness, dynamically manipulate clocks, efficiently s...

Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This is in contrast to classical synthesis, where systems are always “constructed from scratch”. In the control-flow model of composition, exactly one component is in control at a given time and control is switched to another...

The automated synthesis of norms for coordination of multi-agent systems remains an open and complex problem. In this paper we present the Intelligent Robust On-line Norm Synthesis Machine (IRON), a system whose goal is the automated synthesis of norms. IRON is capable of synthesising norms that are at the same time effective (to ensure coordination) and necessary (to avoid overregulation). IRO...

The massive and automated access to Web resources through robots has made it essential for Web service providers to make some conclusion about whether the "user" is a human or a robot. A Human Interaction Proof (HIP) like Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) offers a way to make such a distinction. CAPTCHA is a reverse Turing test used by Web serv...

We show how deterministic Büchi automata can be fully minimised by reduction to the satisfiability (SAT) problem, yielding the first automated method for this task. Size reduction of such ω-automata is an important step in probabilistic model checking as well as synthesis of finite-state systems. Our experiments demonstrate that state-of-theart SAT solvers are capable of solving the resulting s...